#include <bits/stdc++.h>

using namespace std;

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

vector<int> graf[50005];
queue<int> q;
int degree[50005];

int main()
{
	int n,m;
	in>>n>>m;
	for(int i=1;i<=n;i++)
	{
		int x,y;
		in>>x>>y;
		graf[x].push_back(y);
		degree[y]++;
	}
	for(int i=1;i<=n;i++)
		if(degree[i]==0)
			q.push(i);
	while(!q.empty())
	{
		out<<q.front()<<" "; 
		int copie=q.front();
		q.pop();
		for(int i=1;i<=n;i++)
		{
			for(auto j:graf[copie])
			{
				degree[j]--;
				if(degree[j]==0)
					q.push(j);
			}
		}
	}
	return 0;
}