#include <bits/stdc++.h>

using namespace std;

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

int n, m, i, a, b, f[50003];
vector<int> sol, v[50003];

void dfs(int nod){
    f[nod] = 1;
    for(int i=0;i<v[nod].size();i++){
        int vecin = v[nod][i];
        if(f[vecin] == 0)
            dfs(vecin);
    }
    sol.push_back(nod);
}

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

    }
    for(i=1;i<=n;i++)
        if(f[i] == 0)
            dfs(i);
    for(i=sol.size()-1;i>=0;i--)
        fout<<sol[i]<<" ";
    return 0;
}