#include <bits/stdc++.h>
using namespace std;
vector <int> v[50005];
int n, m, i, j,x, y, d[50005];
int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f >> n >> m;
    deque <int> q;
    for(int i = 1; i <= m; i ++)
        f >> x >> y, v[x].push_back(y), d[y] ++;
    for(int i = 1; i <= n; i ++)
        if(d[i] == 0)
            q.push_front(i),g << i << " ";
    while(!q.empty())
    {
        int k = q.back();
        q.pop_back();
        for(int i = 0; i < v[k].size(); i ++)
        {
            d[v[k][i]] --;
            if(d[v[k][i]] == 0)
                q.push_front(v[k][i]), g << v[k][i] << " ";
        }
    }

    return 0;
}