#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <queue>

using namespace std;

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

const int nMax = 50000 + 50;

int n, m;

int grad[nMax];

vector < set < int > > l;
queue < int > q;

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

    l.resize(n + 1);

    for (int i = 1; i <= m; i++)
    {
        int a, b;

        fin >> a >> b;

        auto value = l[a].find(b);

        if (value == l[a].end())
        {
            grad[b]++;
        }


        l[a].insert(b);
    }

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

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

        fout << nod << ' ';

        for (int next : l[nod])
        {
            grad[next]--;

            if (grad[next] == 0)
            {
                q.push(next);
            }
        }
    }

    fin.close();
    fout.close();
    return 0;
}