#include <bits\stdc++.h >
using namespace std;
const int N=100005;
int n,m;
vector<int>p[N];
bool u[N],u1[N];
queue<int>q;
void solve(int x)
{
	cout<<x<<" ";
	for(int i=0,sz=p[x].size();i<sz;i++)
	{
		if(!u[p[x][i]])
		{
			u[p[x][i]]=true;
			solve(p[x][i]);
		}
	}
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int x,y;
		cin>>x>>y;
		p[x].push_back(y);
	}
	u[1]=true;
	solve(1);
	cout<<endl; 
	u[1]=true;
	q.push(1);
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		cout<<x<<" ";
		for(int i=0,sz=p[x].size();i<sz;i++)
		{
			if(!u1[p[x][i]])
			{
				u1[p[x][i]]=true;
				q.push(p[x][i]);
			}
		}
	}
	return 0;
}