#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int MAXN = 7070;
vector<int> G[MAXN];
vector<int> GT[MAXN];
vector<int> order;
bool used[MAXN];

void dfs1(int v) {
    used[v] = true;
    for (int u : G[v]) {
        if (!used[u])
            dfs1(u);
    }
    order.emplace_back(v);
}

int id[MAXN];

void dfs2(int v, int c) {
    id[v] = c;
    for (int u : GT[v]) {
        if (id[u] == -1)
            dfs2(u, c);
    }
}

vector<int> GG[MAXN];
bitset<MAXN> real_g[MAXN];

int was[MAXN];
int couple[MAXN];

bool khun(int v, int c) {
    if (was[v] == c)
        return false;
    was[v] = c;
    for (int i = real_g[v]._Find_first(); i < real_g[v].size(); i = real_g[v]._Find_next(i)) {
        if (couple[i] == -1) {
            couple[i] = v;
            return true;
        }
    }
    for (int i = real_g[v]._Find_first(); i < real_g[v].size(); i = real_g[v]._Find_next(i)) {
        if (khun(couple[i], c)) {
            couple[i] = v;
            return true;
        }
    }
    return false;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        G[a - 1].emplace_back(b - 1);
        GT[b - 1].emplace_back(a - 1);
    }
    fill(used, used + n, false);
    for (int i = 0; i < n; ++i) {
        if (!used[i])
            dfs1(i);
    }
    reverse(order.begin(), order.end());
    fill(id, id + n, -1);
    int cnt = 0;
    for (int v : order) {
        if (id[v] != -1)
            continue;
        dfs2(v, cnt);
        ++cnt;
    }
    for (int v = 0; v < n; ++v) {
        for (int u : G[v]) {
            if (id[u] == id[v])
                continue;
            GG[id[v]].emplace_back(id[u]);
        }
    }
    for (int i = cnt - 1; i >= 0; --i) {
        for (int u : GG[i])
            real_g[i] |= real_g[u];
        real_g[i][i] = true;
    }
    for (int i = 0; i < cnt; ++i)
        real_g[i][i] = false;
    fill(was, was + cnt, -1);
    fill(couple, couple + cnt, -1);
    vector<int> khun_order(cnt);
    for (int i = 0; i < cnt; ++i)
        khun_order[i] = i;
    srand(time(0));
    random_shuffle(khun_order.begin(), khun_order.end());
    int c = 0;
    bool found = true;
    vector<bool> has(cnt, false);
    while (found) {
        found = false;
        ++c;
        for (int i : khun_order) {
            if (!has[i] && khun(i, c)) {
                has[i] = true;
                found = true;
            }
        }
    }
    vector<int> real_color(cnt, -1);
    int ans = 0;
    for (int i = 0; i < cnt; ++i) {
        if (real_color[i] != -1)
            continue;
        int j = i;
        while (couple[j] != -1 && real_color[j] == -1) {
            j = couple[j];
        }
        if (real_color[j] == -1) {
            real_color[j] = ans;
            ++ans;
        }
        int cur = i;
        while (real_color[cur] == -1) {
            real_color[cur] = real_color[j];
            cur = couple[cur];
        }
    }
    for (int i = 0; i < n; ++i)
        cout << 1 + real_color[id[i]] << ' ';
    cout << '\n';
    return 0;
}