#include <iostream>
#include <stdio.h>
#include <fstream>
#include <vector>
using namespace std;
#define max 10001
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector<int> adjList[max];
bool visited[max];
vector<int> topSort;
int n,m;
void dfs(int node){
visited[node] = 1;
for(int i = 0; i < adjList[node].size(); i++){
if(!visited[adjList[node][i]]){
dfs(adjList[node][i]);
}
}
topSort.push_back(node);
}
int main()
{
int x,y;
in >> n >> m;
for(int i = 1; i <= m; ++i){vector<int> topSort;
in >>x >> y;
adjList[x].push_back(y);
}
for(int i=1; i<=n; i++){
if(!visited[i]){
dfs(i);
}
}
for(int i = topSort.size() -1 ; i >=0; i--){
out << topSort[i] << " ";
}
return 0;
}