#include<bits/stdc++.h>
using namespace std;

const int N = 50005;
int n, deg[N];
set<int> req[N], prov[N];
vector<int> sol;
bool visited[N];

ifstream in ("sortaret.in");
ofstream out("sortaret.out");
// auto& in = cin;
// auto& out = cout;

void read()
{
	int m, x, y;
	in>>n>>m;
	for(int i=0;i<m;i++)
	{
		in>>x>>y;
		// req[y].insert(x);
		prov[x].insert(y);
		deg[y]++;
	}
}
void visit(int p)
{
	visited[p] = true;
	sol.push_back(p);
	for(auto el=prov[p].begin(); el!=prov[p].end(); ++el)
	{
		deg[*el]--;
		// req[*el].erase(p);
		// if(req[*el].size() == 0)
		if(deg[*el] == 0)
			visit(*el);
	}
	prov[p].clear();

}
void show()
{
	for(int i=0;i<sol.size();i++)
		out<<sol[i]<<' ';
	out<<endl;
}
int main(){
	read();
	for(int i=1;i<=n;i++)
		if(deg[i] == 0)
		// if(req[i].size() == 0)
			if(!visited[i])
				visit(i);
	show();
	return 0;
}