#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
vector <int> lista[50005];
int grad[50005];
queue <int> q;
int ans[50005];
int main()
{
    int n, m, i, cnt = 0;
    cin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        int x, y;
        cin >> x >> y;
        lista[x].push_back(y);
        grad[y]++;
    }
    for (i = 1; i <= n; i++)
        if (!grad[i])
            q.push(i), ans[++cnt] = i;
    while (cnt < n)
    {
        int x = q.front();
        q.pop();
        for (i = 0; i < lista[x].size(); i++)
        {
            int y = lista[x][i];
            if (grad[y])
                grad[y]--;
            if (!grad[y])
                ans[++cnt] = y, q.push(y);
        }
    }
    for (i = 1; i <= cnt; i++)
        cout << ans[i] << " ";
    return 0;
}