#include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32       = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7        = 1'000'000'007;
constexpr int MOD9        = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&... args) {
    std::cout << head;
    sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
    print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
    for (int i = 0; i < v.size(); i++) {
        std::cout << v[i];
        i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
    }
}
template <class T> void print(std::vector<std::vector<T>> &v) {
    for (int i = 0; i < v.size(); i++) {
        for (int j = 0; j < v[i].size(); j++) {
            std::cout << v[i][j];
            j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
        }
    }
}

struct graph {
    vector<vector<int>> gph;
    vector<int> indeg, outdeg;
    int vertex;
    graph(int N) : vertex(N) {
        gph.resize(vertex);
        indeg.resize(N);
        outdeg.resize(N);
    }
    // 有向グラフの構築
    void directed_update(int in, int out) {
        gph.at(in).emplace_back(out);
        indeg.at(in)++;
        outdeg.at(out)++;
    }
    // 無向グラフの構築
    void undirected_update(int x, int y) {
        gph.at(x).emplace_back(y);
        gph.at(y).emplace_back(x);
    }
};

class strongly_connected_component {
  private:
    graph g, rg;
    vector<bool> vis;
    void dfs(int v) {
        vis[v] = true;
        for (auto &&i : g.gph[v]) {
            if (!vis[i])
                dfs(i);
        }
        ord.emplace_back(v);
    }
    void rdfs(int v, int cnt) {
        vis[v] = true;
        cmp[v] = cnt;
        for (auto &&i : rg.gph[v]) {
            if (!vis[i])
                rdfs(i, cnt);
        }
    }

  public:
    vector<int> cmp, ord;
    strongly_connected_component(const graph &_g)
        : g(_g), rg(_g.vertex), vis(_g.vertex, false), cmp(_g.vertex) {
        for (int i = 0; i < g.vertex; i++) {
            for (auto &&j : g.gph[i]) {
                rg.directed_update(j, i);
            }
        }
    };

    // 強連結成分分解の計算
    // 縮約したグラフの全体の size を返す
    int cal() {
        fill(vis.begin(), vis.end(), false);
        ord.clear();
        for (int i = 0; i < g.vertex; i++) {
            if (!vis[i])
                dfs(i);
        }
        fill(vis.begin(), vis.end(), false);
        int cnt = 0;
        for (int i = ord.size() - 1; i >= 0; i--) {
            if (!vis[ord[i]])
                rdfs(ord[i], cnt++);
        }
        return cnt;
    }
    vector<vector<int>> cycle_paths() {
        vector<vector<int>> ans(cmp.size());
        for (int i = 0; i < g.vertex; i++) {
            ans[cmp[i]].emplace_back(i);
        }
        return ans;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, M;
    cin >> N >> M;
    auto g = graph(N);
    vector<vector<int>> ans(N);
    REP(i, M) {
        int a, b;
        cin >> a >> b;
        g.directed_update(a - 1, b - 1);
    };
    auto scc = strongly_connected_component(g);
    scc.cal();
    auto path = scc.cycle_paths();
    for (auto &&i : path) {
        SORT(i);
        for (auto &&j : i) {
            j++;
        }
    }

    REP(i, N) { print(path[scc.cmp[i]]); }
    return 0;
}


Measured memory_bytes: 4712