#include <iostream> 
#include <fstream>
#include <vector>

using namespace std; 
 
#define N 50005
#define M 100005  
 
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m, x, y;
vector <int> v[N];
int viz[N];
 
int dfs(int nod){
    viz[nod] = 1;
    for(int i=1; i<v[nod].size(); i++){
        if(viz[v[nod][i]] == 0){
            dfs(v[nod][i]);
        }
    }
    return nod;
}
 
int main(){
    fin >> n >> m;
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        v[y].push_back(x);
    }
    for(int i = 1; i <= n; i++){
        if(viz[i]==0){
            fout << dfs(i) << " ";
        }
    }         
}