#include <bits/stdc++.h>

using namespace std;

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

const int N_MAX = 50000 + 5;

vector<int> vec[N_MAX];
bitset<N_MAX> viz;
vector<int> ans;

int n, m;

void sortare_topologica (int nod){
    if(viz[nod])
        return;
    viz[nod] = true;
    for(auto i : vec[nod])
        if(!viz[i])
            sortare_topologica(i);
    ans.push_back(nod);
}

int main()
{
    fin >> n >> m;
    for(int i = 1,a,b; i<=m; ++i){
        fin >> a >> b;
        vec[a].push_back(b);
    }

    for(int i = 1; i<=n; ++i)
        sortare_topologica(i);

    for(int i = ans.size()-1; i>=0; --i)
        fout << ans[i] << " ";

    return 0;
}