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

using namespace std;

void ts(vector<vector<int>> const &g, vector<char> &v, vector<int> &out, int node) {
    if (!v[node]) {
        v[node] = true;
        for (auto neighbour: g[node]) {
            ts(g, v, out, neighbour);
        }
        out.push_back(node);
    }
}

void component(vector<vector<int>> const &tg, vector<int> &compId, vector<int> &out, int node, int id) {
    if (compId[node] == -1) {
        compId[node] = id;
        for (auto neighbour: tg[node]) {
            component(tg, compId, out, neighbour, id);
        }
        out.push_back(node);
    }
}

int main() {
    ifstream fin("ctc.in");
    ofstream fout("ctc.out");
    int N, M;
    fin >> N >> M;
    vector<vector<int>> g(N), tg(N);
    for (int i = 0; i < M; ++i) {
        int a, b;
        fin >> a >> b;
        g[a-1].push_back(b-1);
        tg[b-1].push_back(a-1);
    }
    vector<int> sort;
    vector<char> v(N);
    for (int i = 0; i < N; ++i) {
        ts(g, v, sort, i);
    }
    reverse(sort.begin(), sort.end());
    vector<int> compId(N, -1);
    int id = 0;
    for (int i = 0; i < N; ++i) {
        if (compId[sort[i]] == -1) {
            vector<int> out;
            component(tg, compId, out, sort[i], id++);
            for (auto node: out) {
                fout << node + 1 << ' ';
            }
            fout << '\n';
        }
    }
    return 0;
}