#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define MAXN 100

vector<int> g[MAXN];
vector<int> gr[MAXN];
vector<bool> visited(MAXN, false);
vector<int> scc(MAXN, -1);
vector<int> sortT;

void sortTop(int u) {
    visited[u] = true;
    for(int i = 0; i < g[u].size(); ++i) {
        int next = g[u][i];
        if(!visited[next]) sortTop(next);
    }
    sortT.push_back(u);
}


void dfs(int u, int comp) {
    scc[u] = comp;
    for(int i = 0; i < gr[u].size(); ++i) {
        int next = gr[u][i];
        if(scc[next] == -1) dfs(next, comp);
    }
}



int findScc(int n) {
    int comp = 0;
    for(int i = 0; i < n; ++i) {
        if(!visited[i]) sortTop(i);
    }
    reverse(sortT.begin(), sortT.end());
    for(int i = 0; i < n; ++i) {
        if(scc[i] == -1) {
            comp++;
            dfs(i, comp);
        }
    }
    return comp;
    // Sort Top --
    // Rev Grafo --
    // Dfs -> Sort Top --
}

int main() {
    int n, m, x, y;
    cin >> n >> m;
    for(int i = 0; i < m; ++i) {
        cin >> x >> y;
        g[x].push_back(y);
        gr[y].push_back(x);
    }
    findScc(n);
    for(int i = 0; i < n; ++i) {
        cout << "Node " << i << " = " << scc[i] << endl;
    }
    return 0;
}