#include<fstream>
using namespace std;
int n,m,x,y,v[50001],ok=1,k=1;
struct nod{int x;nod *next;} *b[50001];
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int main()
{f>>n>>m;
for(int i=1;i<=n;i++)
{b[i]=new nod;
b[i]->x=i;
b[i]->next=NULL;
}
for(int i=1;i<=m;i++)
{f>>x>>y;
nod *p=new nod;
for(p=b[x];p->next&&ok;p=p->next)
ok=y!=p->next->x;
if(ok)
{nod *q=new nod;
q->x=y;
q->next=NULL;
p->next=q;
v[y]++;
}
ok=1;
}
for(int i=1;i<=n;i++)
{while(v[k]!=0)
k++;
g<<k<<' ';
for(nod *p=b[k];p;p=p->next)
v[p->x]--;
k=1;
}
return 0;
}