// Problem: G. How Many Paths?
// Contest: Codeforces - Codeforces Round #731 (Div. 3)
// URL: https://codeforces.com/contest/1547/problem/G
// Memory Limit: 512 MB
// Time Limit: 4000 ms

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll          long long
#define pb          push_back
#define endl        '\n'
#define mod         (ll)1000000007
using namespace std;
ll power(ll a , ll b,ll modi)
{
    a%=modi;
    ll res = 1 ;
    while(b)
    {
        if(b%2) {
            res = (res * a) % modi ;
        }
        b/=2 ;
        a = (a*a) % modi ;
    }
    return res ;
}
//unordered_map hash function faster
// struct custom_hash {
    // static uint64_t splitmix64(uint64_t x) {
        // // http://xorshift.di.unimi.it/splitmix64.c
        // x += 0x9e3779b97f4a7c15;
        // x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        // x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        // return x ^ (x >> 31);
    // }
//  
    // size_t operator()(uint64_t x) const {
        // static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        // return splitmix64(x + FIXED_RANDOM);
    // }
// };
//ll fac[200001];
//void facto(){
//	fac[0]=1;
//	for(ll i=1;i<=200000;i++)
//	fac[i]=(fac[i-1]*i)%mod;
//}
//ll ncr(ll n,ll r){
//	ll num=fac[n];
//	num=(num*power(fac[n-r],mod-2,mod))%mod;
//	num=(num*power(fac[r],mod-2,mod))%mod;
//	return num;
//}
vector<int>adj[400001],adj1[400001];
bool mark[400001];
int ans[400001];
int incoming[400001];
void dfs(int s){
	mark[s]=1;
	for(int j=0;j<(int)adj[s].size();j++)
	if(!mark[adj[s][j]])
	dfs(adj[s][j]);
}
void bfs(){
	queue<int>q;
    if(incoming[1]==0)
    q.push(1);
    while(!q.empty()){
    	int f=q.front();
    	q.pop();
    	ans[f]=0;
    	for(int i=0;i<(int)adj1[f].size();i++){
    		incoming[adj1[f][i]]--;
    		if(!incoming[adj1[f][i]])
    		q.push(adj1[f][i]);
    	}
    }
}
void dfs1(int s){
	for(int i=0;i<(int)adj1[s].size();i++){
		if(ans[adj1[s][i]]==-1)
		continue;
		if(ans[adj1[s][i]]<2){
			ans[adj1[s][i]]++;
			dfs1(adj1[s][i]);
		}
	}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
 #endif*/
int t;
	cin>>t;
	while(t--)
	{
	    int n,m;
	    cin>>n>>m;
	    for(int i=1;i<=n;i++){
		    adj[i].clear();
		    adj1[i].clear();
		    ans[i]=-1;
		    incoming[i]=0;
		    mark[i]=0;
	    }
	    for(int i=0;i<m;i++){
	    	int u,v;
	    	cin>>u>>v;
	    	adj[u].pb(v);
	    }
	    dfs(1);
	    for(int i=1;i<=n;i++){
	    	if(mark[i]){
	    		for(int j=0;j<(int)adj[i].size();j++){
	    			if(mark[adj[i][j]]){
		    			adj1[i].pb(adj[i][j]);
		    			incoming[adj[i][j]]++;
	    			}
	    		}
	    	}
	    	else
	    	ans[i]=0;
	    }
	    bfs();
	    if(ans[1]!=-1){
	        dfs1(1);
	        ans[1]=1;
	    }
	    for(int i=1;i<=n;i++)
	    cout<<ans[i]<<" ";
	    cout<<endl;
	}
return 0;
}
