#include <bits/stdc++.h>

using namespace std;

const int BUFFER_SIZE = 1 << 20;
char rb[BUFFER_SIZE], *rp = rb, *rt = rb;
inline char read_char() {
    return rp == rt ? (rt = rb + fread(rb, 1, BUFFER_SIZE, stdin), rp = rb, *rp ++) : *rp ++;
}
inline int read_int() {
    int x = 0;
    char ch = read_char(), flag = 0;
    while (ch != '-' && (ch < '0' || ch > '9')) {
        ch = read_char();
    }
    if (ch == '-') {
        flag = 1;
        ch = read_char();
    }
    for (x = 0; ch >= '0' && ch <= '9'; ch = read_char()) {
        x = x * 10 + (ch - '0');
    }
    return flag ? -x : x;
}

char wb[BUFFER_SIZE], *wp = wb;
inline void write_flush() {
    fwrite(wb, 1, wp - wb, stdout);
    wp = wb;
}
inline void write_char(char c) {
    *wp ++ = c;
    if (wp == wb + BUFFER_SIZE) {
        write_flush();
    }
}
inline void write_int(int x) {
    if (x == 0) {
        write_char('0');
    } else if (x < 0) {
        write_char('-');
        x = -x;
    }
    static char b[32], i;
    for (i = 1; x; i ++) {
        b[i] = x % 10 + '0';
        x /= 10;
    }
    for (i --; i; i --) {
        write_char(b[i]);
    }
}

const int MAX_N = 100000 + 5;
const int MAX_M = 500000 + 5;

int N, M;
int elast[MAX_N], ey[MAX_M], enext[MAX_M];
int vis[MAX_N], ind[MAX_N], f[MAX_N], q[MAX_N], qh, qt;


int main() {
    N = read_int(), M = read_int();
    for (int i = 1; i <= M; i ++) {
        int x = read_int(), y = read_int();
        ey[i] = y, enext[i] = elast[x], elast[x] = i;
    }
    qh = 0, qt = 1, q[0] = 1;
    vis[1] = 1;
    while (qh != qt) {
        int u = q[qh ++];
        for (int j = elast[u], v; j; j = enext[j]) {
            if (!vis[v = ey[j]]) {
                vis[v] = 1;
                q[qt ++] = v;
            }
        }
    }
    for (int i = 1; i <= N; i ++) {
        if (!vis[i]) continue;
        for (int j = elast[i]; j; j = enext[j]) {
            ind[ey[j]] ++;
        }
    }
    if (ind[1]) {
        for (int i = 1; i <= N; i ++) {
            write_int(vis[i] ? 3 : 0), write_char(i < N ? ' ' : '\n');
        }
    } else {
        qh = 0, qt = 1, q[0] = 1;
        vis[1] = 2, f[1] = 1;
        while (qh != qt) {
            int u = q[qh ++];
            for (int j = elast[u], v; j; j = enext[j]) {
                if (!-- ind[v = ey[j]]) {
                    vis[v] = 2;
                    q[qt ++] = v;
                }
                f[v] += f[u];
                f[v] = min(f[v], 2);
            }
        }
        for (int i = 1; i <= N; i ++) {
            int res = vis[i] == 1 ? 3 : vis[i] == 0 ? 0 : f[i];
            write_int(res), write_char(i < N ? ' ' : '\n');
        }
    }
    write_flush();
    return 0;
}