#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mod 1000000007
#define ll unsigned long long
#define bit (1<<18)
#define inf 1000000
#define N 110000
#define mod 1000000007
#define inu "sortaret.in"
#define outu "sortaret.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
queue<int> q;
vector<int> v[N];
int s[N],n,m,gr[N],t,y,x;
int main ()
{
	f>>n>>m;
	FOR(i,1,m)
	{
		f>>x>>y;
		v[x].push_back(y);
		gr[y]++;
	}
	FOR(i,1,n)
	if(!gr[i])
		q.push(i);
	while(!q.empty())
	{
		s[++t]=q.front();
		x=q.front();
		q.pop();
		for(int i=0;i<v[x].size();++i)
		{
			gr[v[x][i]]--;
			if(!gr[v[x][i]])
				q.push(v[x][i]);
		}
	}
	FOR(i,1,t)
	g<<s[i]<<" ";
	return 0;
}