#include <iostream>
#include <queue>
#include <vector>
#include <fstream>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

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

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

void bfs()
{
    while (!q.empty())
    {
        y=q.front();
        q.pop();
        for (auto &v: graph[y])
        {
            fr[v]--;
            if (fr[v]==0)
                q.push(v);
        }
        g << y <<' ';
    }
}

int main()
{
    f >> n >> m;
    for (int i=0; i<m; i++)
    {
        f >> x >> y;
        fr[y]++;
        graph[x].push_back(y);
    }
    for (int i=1; i<=n; i++)
    {
        if (fr[i]==0)
        {
            q.push(i);
        }
    }
    bfs();
    return 0;
}