#include<cstdio>
#include<vector>
using namespace std;
int n,m,x,y,i,grad[50001],in,sf,cd[50001],sol[50001];

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    vector <int> G[50001];
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
        grad[y]+=1;
    }

    for(i=1;i<=n;i++)
        if(grad[i]==0)
        cd[++cd[0]]=i;
    in=1;
    sf=cd[0]+1;

    while(in<sf)
    {
        sol[++sol[0]]=cd[in];
        for(i=0;i<G[cd[in]].size();i++)
        {
            grad[G[cd[in]][i]]--;
            if(grad[G[cd[in]][i]]==0)
            cd[sf]=G[cd[in]][i],sf++;
        }
        in++;
    }
    for(i=1;i<=sol[0];i++)
    printf("%d ",sol[i]);
    return 0;
}