#include <bits/stdc++.h>

using namespace std;
vector<int>nod[50005];
int parents[50005];
queue<int>q;
int n,m,x,y;
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d\n",&x,&y);
        parents[y]++;
        nod[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(parents[i]==0) q.push(i);
    for(int i=1;i<n;i++)
    {
        x=q.front();
        printf("%d ",x);
        q.pop();
        for(int j=0;j<nod[x].size();j++)
        {
            parents[nod[x][j]]--;
            if(parents[nod[x][j]]==0)
                q.push(nod[x][j]);
        }
    }
    printf("%d",q.front());
    return 0;
}