#include<fstream>
#include<vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

int N, viz[50000],m,S[50000];
vector <int>L;
vector <int>v[50000];
vector<int>::iterator it;

void citire()
{
	int i,j;
	in>>N>>m;
	
	for(i=1;i<=N;i++)
		v[i].push_back(i);
	while(in>>i>>j)
		v[i].push_back(j);
	
}









void dfs(int nod)
{
	int i;
	if (viz[nod]==0)
		viz[nod]=1;
	
	for(i=1;i<v[nod].size();i++)
		if(viz[v[nod][i]]==0)
			dfs(v[nod][i]);
	L.push_back(nod);
}

void topsearch ()
{
	int i,j,cntrl,k=1;
	for(i=1;i<=N;i++)
	{
		cntrl=0;
		for(j=1;j<=N;j++)
			for (it=(v[j].begin()+1);it<v[j].end();it++)
				if(*it==i)
				{
					cntrl=1;
					break;
				}
	if(cntrl==0)
	{
		S[k]=i;k++;
	}
}
i=1;
while (S[i]!=0)
	{dfs(S[i]);i++;}

	i=1;
	while(S[i]!=0)
	{
		L.push_back(S[i]);
		i++;
	}
	for(it=(L.end()-2);it>=L.begin();it--)
		out<<" "<<*it;	

}

int main ()
{
	citire();
	topsearch();
}