#include <iostream>
#include <fstream>
#define NMAX 50010
#include <queue>
#include <vector>

using namespace std;

vector <int> edges[NMAX];
queue <int> sol;
int nr[NMAX];

void solve()
{
    ofstream fout("sortaret.out");
    while(!sol.empty())
    {
        int node = sol.front();
        sol.pop();
        for (auto it : edges[node])
        {
            nr[it]--;
            if (nr[it] == 0)
                sol.push(it);
        }
        fout << node << " ";
    }
}

int main()
{
    ifstream fin("sortaret.in");
    int n, m, x, y;
    fin >> n >> m;
    for (int i=1; i<=m; i++)
    {
        fin >> x >> y;
        edges[x].push_back(y);
        nr[y]++;
    }
    for (int i=1; i<=n; i++)
    {
        if (nr[i] == 0)
            sol.push(i);
    }
    solve();
    return 0;
}