傻逼题。
/* Pigonometry */
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100005, maxm = 200005, maxq = 200000;
int n, m, head[maxn], cnt, in[maxn], out[maxn], dp[maxn], q[maxq];
bool vis[maxn];
struct _edge {
int v, next;
} g[maxm << 1];
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}
inline void add(int u, int v) {
g[cnt] = (_edge){v, head[u]};
head[u] = cnt++;
}
int main() {
n = iread(); m = iread();
for(int i =