#include <fstream>
#include <vector>
#include <queue>

#define NMAX 50005

using namespace std;

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

queue<int> q;

int n, m;
int x, y;
vector<int> l[NMAX];
int grad[NMAX];
int vf, vfnou;
int i;

int main()
{
    fin >>n>>m;
    for (i = 1; i <= m; ++i)
    {
        fin >>x>>y;
        l[x].push_back(y);
        grad[y] ++;
    }

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

    while (!q.empty())
    {
        vf = q.front(); q.pop();
        fout <<vf<<' ';
        for (i = 0; i < l[vf].size(); ++i)
        {
            vfnou = l[vf][i];
            grad[vfnou] --;
            if (grad[vfnou] == 0)
                q.push(vfnou);
        }
    }

    fout <<'\n';
    fout.close();
    return 0;
}