#include <iostream>
#include <fstream>
#include <vector>
#define nmax 50005
using namespace std;

int n, m, a, b;
bool seen[nmax];
vector <int> v[nmax], sol;

void solve(int x) {
	seen[x] = true;
	for(int i=0; i<int(v[x].size()); i++)
		if(!seen[v[x][i]]) solve(v[x][i]);

	sol.push_back(x);
}
int main() {
	ifstream f("sortaret.in");
	ofstream g("sortaret.out");

	f>>n>>m;
	for(int i=1; i<=m; i++) {
		f>>a>>b;
		v[b].push_back(a);
	}
	for(int i=1; i<=n; i++)
		if(!seen[i]) solve(i);

	for(int i=0; i<int(sol.size()); i++) g<<sol[i]<<" ";

	return 0;
}