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

using namespace std;

vector <int> g[50005];
queue <int> q;

int n, m, x, y;
int grade[50005];

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);
        g[x].push_back(y);
        grade[y]++;
    }
    for(int i=1; i<=n; i++)
    {
        if(grade[i] == 0)
            q.push(i);
    }
    while(!q.empty())
    {
        int node=q.front();
        printf("%d ", node);
        q.pop();
        for(auto &v:g[node])
        {
            grade[v]--;
            if(grade[v] == 0)
                q.push(v);
        }
    }

    return 0;
}