/*
#include <stdio.h>
#include <queue>
#include <list>

using namespace std;

int gin[50001];
char viz[50001];

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int n,m,x,y,i,j;
    list<int> v[50001],l;
    list<int>::const_iterator itr,fin;
    queue<int> c,r;
    scanf("%d%d",&n,&m);
    for(i=0;i<m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        gin[y]++;
    }
    for(i=1;i<=n;i++)
        if(gin[i]==0) {c.push(i);viz[i]=1;}
    while(!c.empty())
    {
        x=c.front();
        r.push(x);
        c.pop();
        for(itr=v[x].begin(),fin=v[x].end();itr!=fin;itr++)
        {
            gin[*itr]--;
            if(gin[*itr]==0) {c.push(*itr);viz[*itr]=1;}
        }
    }
    while(!r.empty())
    {
        printf("%d ",r.front());
        r.pop();
    }
    return 0;
}
*/



#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("sortaret.in");
ofstream o("sortaret.out");
int g[50001];
int main()
{int p,u,n,m,i,a,b;
queue<int>q;
vector<int>v[50001];
vector<int>::const_iterator in,fi;
f>>n>>m;
for(i=0;i<m;i++)
{
    f>>a>>b;
    g[b]++;
    v[a].push_back(b);
}
for(i=1;i<=n;i++)if(g[i]==0)q.push(i);
while(!q.empty())
{
    a=q.front();
    q.pop();o<<a<<" ";
    in=v[a].begin();fi=v[a].end();
     for(in;in!=fi;in++)
     {
         g[*in]--;
         if(g[*in]==0){q.push(*in); }
     }

}


    return 0;
}