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

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

int main()
{
    int n,m,x,y;
    f>>n>>m;

    vector<vector<int>> G(n+1);
    vector<int> grade(n+1,0);
    queue<int> q;

    for (int i=0; i<m; i++)
    {
        f>>x>>y;
        G[x].push_back(y);
        grade[y]++;
    }

    for (int i=1; i<=n; i++)
        if (!grade[i])
            q.push(i);

    while (!q.empty())
    {
        g<<q.front()<<" ";

        for (auto vecin:G[q.front()])
        {
            grade[vecin]--;
            if (!grade[vecin])
                q.push(vecin);
        }

        q.pop();
    }
}