#include <string.h>
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <stdio.h>

using namespace std;

vector <int> viz, rez,ine;
vector <vector <int> > ed, par; 
int maxt = 0;

void parc (int x, int t) {
	int i, j;
	
	viz[x]++;
	rez[x] = t;
	if (t>maxt) {
		maxt = t;
	}
	//
	
	for (i=0; i<ed[x].size(); i++) {	
		if (!viz[ed[x][i]]) {
			//cout<<"haha "<<ed[x][i]<<endl;
			viz[ed[x][i]]++;
			parc(ed[x][i], t+1);
		}
		
		else if (rez[ed[x][i]] < t+1) {
			//cout<<"hihi "<<ed[x][i]<<endl;
			parc(ed[x][i], t+1);
		}
	}

}


int main() {

freopen("sortaret.in", "r", stdin);
freopen("sortaret.out", "w", stdout);

int tst, n, i, j, k, m, n1, n2, l, sum, vmin, arest, maxv;


cin>>n>>m;

viz.resize(n+1, 0);
ed.resize(n+1);
par.resize(n+1);
rez.resize(n+1, 0);
ine.resize(n+1, 0);

for (i=0; i<m; i++) {
	cin>>n1>>n2;
	//cout<<n1<<" "<<n2<<endl;
	ed[n1].push_back(n2);
	ine[n2]++;
}

for (i=1; i<=n; i++) {
	if (ine[i] == 0) {
		parc(i,0);
		//cout<<i<<endl;
		//break;
	}
		
}

for (i=1; i<=n; i++) {
	
	par[rez[i]].push_back(i);
}



for (i=0; i<=maxt; i++) {
	for (j=0; j<par[i].size(); j++)
		cout<<par[i][j]<<" ";
}
	
	
cout<<endl;

return 0;

}