#include<bits/stdc++.h>
using namespace std;
int n,m;
vector<int> v[1000005];
bool b[100005];
bool cmp(int x,int y) {return x<y;}
void dfs(int x,int step)
{
	b[x]=1;
	cout<<x<<" ";
	if(step==n) return ;
	for(int i=0;i<v[x].size();i++) if(b[v[x][i]]==0) dfs(v[x][i],step+1);
}
int head,tail,q[1000005];
void bfs(int x)
{
	head=0;
	tail=1;
	q[1]=x;
	b[1]=0;
	cout<<1<<" ";
	while(head<tail)
	{
		head++;
		int x1=q[head];
		for(int j=0;j<v[x1].size();j++)
		{
			int xx=v[x1][j];
			if(b[xx]==0)
			{
				b[xx]=1;
				cout<<xx<<" ";
				tail++;
				q[tail]=xx;
			}
		}
	}
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
    	int x,y;
    	cin>>x>>y;
    	v[x].push_back(y);
	}
	for(int i=1;i<=n;i++) sort(v[i].begin(),v[i].end());
	dfs(1,1);
	cout<<endl;
	memset(b,0,sizeof(b));
	bfs(1);
	return 0;
}