#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> p[100005];
bool u[100005];
queue <int> q;
void solve(int x){
    cout<<x<<" ";
    sz=p[x].size();
    for(int i=0;i<sz;i++)
    if(!u[p[x][i]]){
        u[p[x][i]]=true;
        solve(p[x][i]);
    }
}
int main()
{
    scanf("%d%d",&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;
    memset(u,0,sizeof u);
    u[1]=true;
    q.push(1);
    while(!q.empty()){
        int x=q.front();
        q.pop();
        cout<<x<<" ";
        int sz=p[x].size();
        for(int i=0;i<sz;i++)
        if(!u[p[x][i]]){
            u[p[x][i]]=true;
            q.push(p[x][i]);
        }
    }
    

    return 0;
}