哇，WA!

#include <bits/stdc++.h>
#define maxN 100005
#define int long long

using namespace std;

int n, m;
bool vis_dfs[maxN], vis_bfs[maxN];
vector < int > g_dfs[maxN];
vector < int > g_bfs[maxN];
queue < int > q;

void dfs(int now) {
	cout << now<< " ";
	for (int i = 0; i < g_dfs[now].size(); i++)
		if (vis_dfs[g_dfs[now][i]] == false) {
			vis_dfs[g_dfs[now][i]] = true;
			dfs(g_dfs[now][i]);
		}
}
signed main() {
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n>> m;
	for (int i = 1; i <= m; i++) {
		int x, y;
		cin >> x>> y;
		g_dfs[x].push_back(y);
		g_bfs[x].push_back(y);
	}
	vis_dfs[1] = true;
	dfs(1);
	cout << "\n";
	vis_bfs[1] = true;
	q.push(1);
	while (!q.empty()) {
		int now = q.front();
		q.pop();
		cout << now<< " ";
		for (int i = 0; i < g_bfs[now].size(); i++)
			if (vis_bfs[g_bfs[now][i]] == false) {
				vis_bfs[g_bfs[now][i]] = true;
				q.push(g_bfs[now][i]);
			}
	}
	return 0;
}