#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
#define itn int
#define sacnf scanf
// printf("%.10f\n", ans);
using ll = long long;
using namespace std;
const ll mod = 1e9 + 7;
const int N = 1e5 + 1;
int n, m;
vector<vector<int>> gp;
vector<int> ans, cnt;
vector<bool> vis, cycles, path;

void dfs1(int u)
{
    vis[u] = 1;
    for (int& v : gp[u]) if (!vis[v]) dfs1(v);
}

void dfs2(int u)
{
    vis[u] = 1;
    path[u] = 1;
    for (int& v : gp[u])
    {
        if (path[v]) cycles[v] = 1;
        if (!vis[v]) dfs2(v);
    }
    path[u] = 0;
}

void dfs3(int u)
{
    vis[u] = 1;
    for (int& v : gp[u]) if (!vis[v]) dfs3(v);
}

void dfs4(int u)
{
    vis[u] = 1;
    for (int& v : gp[u])
    {
        cnt[v]++;
        if (!vis[v]) dfs4(v);
    }
}

void dfs5(int u)
{
    ans[u] = 2;
    vis[u] = 1;
    for (int& v : gp[u]) if (!vis[v] && ans[v] == -2) dfs5(v);
}

void test_case()
{
    scanf("%d%d", &n, &m);
    gp = vector<vector<int>>(n);
    ans = vector<int>(n, -2);
    cnt = vector<int>(n);
    vis = cycles = path = vector<bool>(n);
    for (int i = 0; i < m; i++)
    {
        int u, v;
        scanf("%d%d", &u, &v);
        gp[--u].push_back(--v);
    }
    dfs1(0);
    for (int i = 0; i < n; i++) if (!vis[i]) ans[i] = 0;
    vis = vector<bool>(n);
    dfs2(0);
    vis = vector<bool>(n);
    for (int i = 0; i < n; i++) if (cycles[i] && !vis[i]) dfs3(i);
    for (int i = 0; i < n; i++) if (vis[i]) ans[i] = -1;
    vis = vector<bool>(n);
    dfs4(0);
    vis = vector<bool>(n);
    for (int i = 0; i < n; i++) if (!vis[i] && cnt[i] >= 2 && ans[i] == -2) dfs5(i);
    for (int i = 0; i < n; i++) if (ans[i] == -2) ans[i] = 1;
    for (int& i : ans) printf("%d ", i);
    printf("\n");
}

int main()
{
    /*ios_base::sync_with_stdio(false);
    cin.tie(NULL);*/
    int tc;
    scanf("%d", &tc);
    while (tc--)
        test_case();

    return 0;
}

