///infoarena Sortare topologica
#include <fstream>
#include <vector>
#include <set>

#define NMAX 50005

using namespace std;

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

set<int> s;

int n, m;
int x, y;
vector<int> l[NMAX];
int di[NMAX];
int vf;
vector<int> ans;
int i, j;

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

    for (i = 1; i <= n; ++i)
        if (!di[i]) s.insert(i);

    while (!s.empty())
    {
        vf = *s.begin(); s.erase(s.begin());
        ans.push_back(vf);

        for (auto vfnou: l[vf])
        {
            di[vfnou] --;
            if (!di[vfnou])
                s.insert(vfnou);
        }
    }

    for (auto i: ans) fout <<i<<' ';
    fout <<'\n';
    fout.close();
    return 0;
}