#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50010

using namespace std;

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

int n, m, d[NMAX];
bool viz[NMAX];
vector<int> A[NMAX];
queue<int> Q;

int main()
{
    int i, a, b, nod, urm;
    fin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        fin >> a >> b;
        A[a].push_back(b);
        d[b]++;
    }
    for (i = 1; i <= n; i++)
    {
        if (!d[i])
            Q.push(i);
    }
    while (!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        viz[nod] = 1;
        fout << nod << ' ';
        for (i = 0; i < A[nod].size(); i++)
        {
            urm = A[nod][i];
            if (!viz[urm])
            {
                d[urm]--;
                if (!d[urm])
                    Q.push(urm);
            }
        }
    }
    fout.close();
    return 0;
}