#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
std::vector<int> v[1000];
bool vazut[1000];
int final[1000];
int n, m, nr, x, y, k;
void dfs(int nod){
     vazut[nod] = 1;
     for(int i = 0; i < v[nod].size(); i++){
     	if(vazut[v[nod][i]] == 0){
     		int k = v[nod][i];
     		dfs(v[nod][i]);

     	}
       
     }
     final[++k] = nod;
     
}

int main(){
	fin >> n >> m;
   for(int i = 1;i <= m; i++){
       fin >> x >> y;
       v[x].push_back(y);
   }
   for(int i = 1;i <= n; i++){
   	if(vazut[i] == 0){
   		dfs(i);
   	}
   }
   for(int i = k; i > 0; i--){
   	fout << final[i]<<" ";
   }
   return 0;
}