提交记录：link

code：

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