#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second
#define cl       clear
#define sep      ' '
#define endll    '\n'

const int maxn  =  1e6   + 10;
const int maxn5 =  5e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const ll  mod   =  1e9   +  7;
const ll  inf   =  2e18;

vector <int> srt, adj[maxn5], jda[maxn5], exadj[maxn5];
int val[maxn5], cmp[maxn5], cnt[maxn5], num = 0;
bool mark[maxn5];

void dfs1(int v){
    mark[v] = true;
    for(auto u : adj[v]) if(!mark[u]) dfs1(u);
    srt.pb(v);
    return;
}
void dfs2(int v){
    mark[v] = true;
    cmp[v] = num;
    cnt[num]++;
    //cout << v << ' ' << num << endl;
    for(auto u : jda[v]) if(!mark[u]) dfs2(u);
    return;
}
void dfs3(int v){
    mark[v] = true;
    for(auto u : exadj[v]) if(!mark[u]) dfs3(u);
    srt.pb(v);
    return;
}
int main()
{
    //cout << setprecision(15);
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

    int tt; cin >> tt;
    while(tt--){
        int n, m; cin >> n >> m;
        for(int i = 0; i <= n; i++){
            adj[i].cl(); jda[i].cl(); exadj[i].cl();
        }
        for(int i = 0; i < m; i++){
            int a, b; cin >> a >> b;
            adj[a].pb(b);
            jda[b].pb(a);
        }
        srt.cl();
        fill(mark, mark + n + 10, false);
        fill(cnt, cnt + n + 10, 0);
        for(int i = 1; i <= n; i++) if(!mark[i]) dfs1(i);
        reverse(all(srt));
        fill(mark, mark + n + 10, false);
        num = 0;
        for(auto u : srt) if(!mark[u]){
            dfs2(u);
            num++;
        }
        for(int i = 1; i <= n; i++) for(auto u : adj[i]){
            if(cmp[i] != cmp[u]) exadj[cmp[i]].pb(cmp[u]);
            else if(u == i) cnt[cmp[i]]++;
        }
        fill(val, val + n + 10, 0);
        srt.cl();
        fill(mark, mark + n + 10, false);
        for(int i = 0; i < num; i++) if(!mark[i]) dfs3(i);
        reverse(all(srt));
        val[cmp[1]] = 1;
        if(cnt[cmp[1]] > 1) val[cmp[1]] = 3;
        for(auto v : srt){
            if(val[v] == 0) continue;
            if(cnt[v] > 1) val[v] = 3;
            for(auto u : exadj[v]){
                if(val[v] >= 2) val[u] = max(val[v], val[u]);
                else if(val[v] == 1) val[u] = max(val[u], min(2, val[u] + 1));
            }
        }
        for(int i = 1; i <= n; i++) cout << (val[cmp[i]] == 3 ? -1 : val[cmp[i]]) << ' ' ;
        cout << endll;
    }
    return 0;
}