#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#define NMAX 50005
using namespace std;
int n,m;
vector<int> A[NMAX];
int grad[NMAX], viz[NMAX];
queue<int> q;
int main()
{
    int i;
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d %d", &n, &m);
    memset(grad,0,sizeof(grad));
    for(i=1;i<=m;i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        A[x].push_back(y);
        grad[y]++;
    }
    for(i=1;i<=n;i++)
    {
        if(grad[i] == 0)
            q.push(i);
    }
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        printf("%d ", x);
        for(int vecin : A[x])
        {
            grad[vecin]--;
            if(grad[vecin] == 0)
                q.push(vecin);
        }
    }
    
}