#include <bits/stdc++.h>
#define N 50001
#define M 100001
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int nr,vf[2*M],urm[2*M],lst[N],v[N],k;
bool viz[N];
void dfs(int x)
{
	int p=lst[x],y;
	viz[x]=1;
	while(p)
	{
		y=vf[p];
		if(!viz[y])
		    dfs(y);
		p=urm[p];
	}
	v[k++]=x;
}
void ad(int x,int y)
{
	vf[++nr]=y;
	urm[nr]=lst[x];
	lst[x]=nr;
}
int main()
{
    int n,m,i,x,y;
    in>>n>>m;
	for(i=0;i<m;i++)
	{
		in>>x>>y;
		ad(x,y);
	}
	for(i=1;i<=n;i++)
	    if(!viz[i])
	        dfs(i);
	for(i=k-1;i>=0;i--)
	    out<<v[i]<<" ";
    return 0;
}