#include <bits/stdc++.h>

using namespace std;

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

int n, m, a, b;
int intrari[50005];
vector<int>graph[50005];
queue<int>q;

void solve()
{
    int sus;
    while (!q.empty())
    {
        sus=q.front();
        q.pop();
        g << sus <<' ';
        for (auto &v:graph[sus])
        {
            intrari[v]--;
            if (!intrari[v])
                q.push(v);
        }
    }
}

int main()
{
    f >> n >> m;
    for (int i=1; i<=m; ++i)
    {
        f >> a >> b;
        graph[a].push_back(b);
        intrari[b]++;
    }
    for (int i=1; i<=n; ++i)
    {
        if (!intrari[i])
        {
            q.push(i);
        }
    }
    solve();
    return 0;
}