#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")

#define int long long
#define pb push_back
#define all(s) s.begin(),s.end()
#define pii pair<int,int>
#define fr first
#define sc second
#define bst ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define no cout << "NO" << endl;
#define yes cout << "YES" << endl;

using namespace std;

const int N = 5e5 + 10, mod = 1e9 + 7, inf = 1e18 + 7, logn = 23;
const double pi = acos(-1);

vector<int> gr[N], tgr[N];
vector<int> order, comp;
int vis[N];

void dfs1(int v) {
	vis[v] = 1;
	for(auto to: gr[v]) {
		if(!vis[to]) {
			dfs1(to);
		}
	}
	order.pb(v);
}

void dfs2(int v) {
	vis[v] = 1;
	comp.pb(v);
	for(auto to: tgr[v]) {
		if(!vis[to]) {
    	dfs2(to);
    }
	}
}

void solve() {
	//soln
	int n, m;
	cin >> n >> m;

	while(m--) {
		int l, r;
		cin >> l >> r;
		gr[l].pb(r);
		tgr[r].pb(l);
	}

	for(int i = 1; i <= n; i++) {
		if(!vis[i]) {
			dfs1(i);
		}
	}
	for(int i = 1; i <= n; i++) {
		vis[i] = 0;
	}
	reverse(all(order));
	for(auto it: order) {
		if(!vis[it]) {
			dfs2(it);
			for(auto v: comp) {
				cout << v << " ";
			}
			cout << endl;
			comp.clear();
		}
 	}
}
main() {
	bst;
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
}