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

using namespace std;

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

vector < set < int > > l;
queue < int > q;
int g[50005];
int n, m;

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

    l.resize(n + 1);

    int a, b;

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

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

        if(s == l[a].end())
            g[b]++;

        l[a].insert(b);

    }

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

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

        fout << nod << ' ';

        for(int el : l[nod])
        {
            g[el]--;

            if(g[el] == 0)
            {
                q.push(el);
            }
        }
    }

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