#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;
const int nmax=50000;
int pred[nmax+3], sol[nmax+3];
queue <int> q;
vector <int> succ[nmax+3];
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int n,m,i,u,v,j,k=0;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&u,&v);
        pred[v]++;
        succ[u].push_back(v);
    }
    for(i=1;i<=n;i++)
        if(pred[i]==0) q.push(i);
    while(!q.empty())
    {
        u=q.front();
        sol[++k]=u;
        q.pop();
        for(j=0;j<(int)succ[u].size();j++)
        {
            v=succ[u][j];
            pred[v]--;
            if(pred[v]==0)
            {
                q.push(v);
            }            
        }
    }
    for(i=1;i<=n;i++)
        printf("%d ",sol[i]);
    return 0;
}