#include <bits/stdc++.h>

#define DIM 50010

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m;
int grad[DIM];
vector <int> g[DIM];
queue <int> q;

int main()
{
    fin >> n >> m;
    for (int a, b; m; m--)
    {
        fin >> a >> b;
        g[a].push_back(b);
        grad[b]++;
    }
    for (int i = 1; i <= n; i++)
    {
        if (grad[i] == 0)
        {
            fout << i << ' ';
            q.push(i);
        }
    }
    while (!q.empty())
    {
        int node = q.front(); q.pop();
        for (vector <int> :: iterator it = g[node].begin(); it != g[node].end(); ++it)
        {
            int v = *it;
            grad[v]--;
            if (grad[v] == 0)
            {
                fout << v << ' ';
                q.push(v);
            }
        }
    }
    return 0;
}