#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long
typedef int uci;
#define int long long
#define F first
#define S second

const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

//! function insert

//THINK FIRST, CODE SECOND
//DON'T GET STUCK ON ONE STRATEGY
//CALM DOWNNN FOR ONCE IN YOUR LIFE
//REDUCE
//COUGH E??!?!?!! O.O
//uwu i see you ryan

void mark(int v, set<int> &curr, vector<bool> &loop, vector<bool> &multi, vector<vector<int>> &adj, vector<bool> &visited){
    visited[v] = true;
    for(int i{}; i < adj[v].size(); ++i){
        if(curr.count(adj[v][i])){
            loop[adj[v][i]] = true;
        }else if(visited[adj[v][i]]){
            multi[adj[v][i]] = true;
        }else{
            curr.insert(adj[v][i]);
            mark(adj[v][i], curr, loop, multi, adj, visited);
            curr.erase(curr.find(adj[v][i]));
        }
    }
}

void setouts(int v, bool inloop, bool inmulti, vector<bool> &loop, vector<bool> &multi, vector<vector<int>> &adj, vector<bool> &visited, vector<int> &outs){
    visited[v] = true;
    if(inloop|loop[v]){
        outs[v] = -1;
    }else if(multi[v]|inmulti){
        outs[v] = 2;
    }else{
        outs[v] = 1;
    }
    for(int i{}; i < adj[v].size(); ++i){
        if(inloop|loop[v] && outs[adj[v][i]] != -1){
            setouts(adj[v][i], inloop|loop[v], inmulti|multi[v], loop, multi, adj, visited, outs);
        }else if(multi[v]|inmulti && outs[adj[v][i]] != 2 && outs[adj[v][i]] != -1){
            setouts(adj[v][i], inloop|loop[v], inmulti|multi[v], loop, multi, adj, visited, outs);
        }else if(!visited[adj[v][i]]){
            setouts(adj[v][i], inloop|loop[v], inmulti|multi[v], loop, multi, adj, visited, outs);
        }
    }
}

void solve() {
    int n, m;
    cin >> n >> m;
    vector<bool> loop(n+1), multi(n+1), visited(n+1);
    vector<vector<int>> adj(n+1);
    for(int i{}; i < m; ++i){
        int a, b;
        cin >> a >> b;

        adj[a].push_back(b);
    }
    set<int> current{1};
    mark(1, current, loop, multi, adj, visited);
    vector<int> outs(n+1);
    visited.clear();
    visited.resize(n+1);
    setouts(1, loop[1], multi[1], loop, multi, adj, visited, outs);
    for(int i{1}; i <= n; ++i)
        cout << outs[i] << ' ';
    cout << '\n';
}

uci main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int tc; cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}