#include <cstdio>
#define N 50000
using namespace std;
struct nod{
           int info;
           nod *urm;
          }*l[N];
int n,pre[N],viz[N],nr;
void read()
{
int m,i,x,y;
nod *p;
freopen("sortaret.in","r",stdin);
scanf("%d%d",&n,&m);
while (m--)
   {
   scanf("%d%d",&x,&y);
   p=new nod;p->info=y;p->urm=l[x];l[x]=p;
   }
}
void dfs(int vf)
{
int i;
nod *p;
viz[vf]=1;
for (p=l[vf];p!=NULL;p=p->urm)
    {
    i=p->info;
    if (!viz[i]) dfs(i);
    }
pre[++nr]=vf;
}
int main()
{
int i;
freopen("sortaret.out","w",stdout);
read();
for (i=1;i<=n;i++)
if (!viz[i]) dfs(i);
for (i=nr;i>0;i--) printf("%d ",pre[i]);
}