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

using namespace std;

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

void solve ();

int n, m, x, y;

int subord[50007];

vector <int> v[50007];

queue <int> q;

int main()
{
    in >> n >> m;
    for (register int i=1; i<=m; ++i)
    {
        in >> x >> y;
        v[x].push_back(y);
        ++subord [y];
    }
    solve ();

    return 0;
}

void solve ()
{
    int nod;
    for (register int i=1; i<=n; ++i)
        if (subord[i] == 0)
            q.push (i);
    while (!q.empty ())
    {
        nod = q.front();
        q.pop ();
        out << nod << " ";
        for (register int i=0; i<v[nod].size (); ++i)
        {
            --subord[v[nod][i]];
            if (subord[v[nod][i]] == 0)
                q.push (v[nod][i]);
        }
    }
}