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

constexpr const int NMAX = 5e4+5;
using namespace std;

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

vector < int > g[NMAX];
vector < int > sol;

short viz[NMAX];
int n, m;

void dfs(int nod){
	viz[nod] = 1;
	for(int i : g[nod])
		if(!viz[i])
			dfs(i);
	sol.push_back(nod);
}

int main(){
	fin >> n >> m;
	for(int i = 0, x, y; i < m; i++){
		fin >> x >> y;
		g[x].push_back(y);
	}
	fin.close();
	for(int i = 1; i <= n; i++)
		if(!viz[i])
			dfs(i);
	for(int i = sol.size() - 1; i >= 0; i--)
		fout << sol[i] << ' ';
	fout.close();
	return 0;
}