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

using namespace std;

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

int n, m;
vector<int> gra[50041];
bool nostart[50041];
void read(){
	fin >> n >> m;
	for(int i = 0; i < m; ++i){
		int a, b;
		fin >> a >> b;
		gra[a].push_back(b);
		nostart[b] = true;
	}
}

bool vi[50041];
stack<int> s;
void dfs(int a){
	vi[a] = true;
	for(auto b : gra[a]){
		if(!vi[b]){
			dfs(b);
		}
	}
	s.push(a);
}

void write(){
	while(!s.empty()){
		fout << s.top() << " ";
		s.pop();
	}
}

void topological(){
	for(int i = 1; i <= n; ++i){
		if(!nostart[i]){
			dfs(i);
		}
	}
}

int main(){
	read();
	topological();
	write();
	return 0;
}