#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 1e5 + 3;

vector <int> v[nmax];
queue <int> q;
int n, m, x, y, grad[nmax], nod;

int main()
{
    f >> n >> m;

    while (m--)
    {
        f >> x >> y;
        grad[y]++;
        v[x].push_back(y);
    }

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

    while (!q.empty())
    {
        nod = q.front();
        q.pop();

        g << nod << ' ';

        for (int i = 0; i < v[nod].size(); ++i)
        {
            --grad[v[nod][i]];
            if (!grad[v[nod][i]])
                q.push(v[nod][i]);
        }
    }

    return 0;
}