#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define cout cerr
#define MAX 50005

using namespace std;

int n,m,x,y,b[MAX];
vector <int> a[MAX];
queue <int> q;

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    scanf("%d %d",&n,&m);
    for(int i=1; i<=m; i++)
    {
        scanf("%d %d",&x,&y);
        a[x].push_back(y);
        b[y]++;
    }

    for(int i=1; i<=n; i++)
        if(b[i]==0)
            q.push(i);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        if(b[x]==0)
            printf("%d ",x),b[x]--;
        for(int i=0;i<a[x].size();i++)
            if(b[a[x][i]]!=0)
            {
                b[a[x][i]]--;
                q.push(a[x][i]);
            }
    }
    return 0;
}