#include <bits/stdc++.h>

using namespace std;

const int MAXN = 50005;

vector<int> graf[MAXN];
int grad[MAXN], ans[MAXN];

int main()
{
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    int n, m;
    fin >> n >> m;
    while(m){
        int x, y;
        fin >> x >> y;
        grad[y]++;
        graf[x].push_back(y);
        m--;
    }
    int len = 0;
    for(int i = 1; i <= n; ++i){
        if(grad[i] == 0)
            ans[++len] = i;
    }
    for(int nod = 1; nod <= n; ++nod){
        for(int i = 0; i < int(graf[nod].size()); ++i){
            grad[graf[ans[nod]][i]]--;
            if(grad[graf[ans[nod]][i]] == 0){
                ans[++len] = graf[ans[nod]][i];
                graf[ans[nod]].erase(graf[ans[nod]].begin() + i);
                i--;
            }
        }
    }
    for(int i = 1; i <= n; ++i)
        fout << ans[i] << " ";
    return 0;
}