#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<iostream>
using namespace std;
const int maxn = 1e5 + 10;
vector<int> v[maxn];
int n,m;
bool used[maxn];
void DFS(int x){
	printf("%d ",x);
	used[x]=1;
	for(int i=0;i<v[x].size();i++){
		int y = v[x][i];
		if(!used[y])DFS(y);
	}
}
void BFS(int x){
	queue<int> q;
	q.push(x);used[x]=1;
	while(q.size()){
		int y=q.front();
		cout<<y<<' ';//玄学，不能用printf 
		q.pop();
		for(int i=0;i<v[y].size();i++){
			int to=v[y][i];
			if(!used[to]){
				used[to]=1;q.push(to);
			}
		}
	}
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		int x,y;scanf("%d%d",&x,&y);
		v[x].push_back(y);
	}
	for(int i=1;i<=n;i++){
		sort(v[i].begin(),v[i].end());
	}
	memset(used,0,sizeof(used));DFS(1);printf("\n");
	memset(used,0,sizeof(used));BFS(1);printf("\n");
	return 0;
}