#include <bits/stdc++.h>

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

int n, m;
vector <vector <int> > g;
vector <int> deg, q;

int main()
{
    fin >> n >> m;
    deg.resize(n + 2);
    q.resize(n + 2);
    g.resize(n + 2);
    for(int i = 1 ; i <= m ; i++)
    {
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
        deg[y]++;
    }
    while(q[0] < n)
    {
        for(int i = 1; i <= n ; i++)
        {
            if(deg[i] == 0)
            {
                deg[i] = -1;
                q[++q[0]] =  i;
                for(auto nxt: g[i])
                    deg[nxt]--;
            }
        }
    }
    for(int i = 1 ; i <= n ; i++)
        fout << q[i] << ' ';
    return 0;
}