#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
vi check_validity(int N, vi X, vi Y, vi S, vi E, vi L, vi R) {
int M = (int)size(X), Q = (int)size(S);
vector<vi> left(N), right(N);
for (int j = 0; j < M; ++j) {
int u = X[j], v = Y[j];
if (u > v) swap(u, v);
left[v].push_back(u);
right[u].push_back(v);
}
vi pl(N, N), pr(N, -1), p;
auto find = [&](auto& self, int u, int lb, int ub) -> int {
return p[u] < lb || ub < p[u] ? u : p[u] = self(self, p[u], lb, ub);
};
p = pl;
for (int u = 0; u < N; ++u) {
for (auto v : left[u]) {
v = find(find, v, 0, N - 1);
if (v != u) p[v] = pl[v] = u;
}
}
p = pr;
for (int u = N - 1; u >= 0; --u) {
for (auto v : right[u]) {
v = find(find, v, 0, N - 1);
if (v != u) p[v] = pr[v] = u;
}
}
vector<vi> F(N);
for (int u = 0; u < N; ++u) {
if (int v = pr[u]; v != -1) F[v].push_back(u);
}
vi l(N), r(N);
int timer = 0;
auto tour = [&](auto& self, int u) -> void {
l[u] = timer;
for (auto v : F[u]) self(self, v);
r[u] = timer++;
};
for (int u = 0; u < N; ++u) {
if (pr[u] == -1) tour(tour, u);
}
vi subleft(Q), subright(Q), I(Q);
iota(begin(I), end(I), 0);
p = pl;
sort(begin(I), end(I), [&](int q1, int q2){ return R[q1] < R[q2]; });
for (auto q : I) subleft[q] = find(find, E[q], 0, R[q]);
p = pr;
sort(begin(I), end(I), [&](int q1, int q2){ return L[q1] > L[q2]; });
for (auto q : I) subright[q] = find(find, S[q], L[q], N - 1);
vector<vi> queries(N);
for (auto q : I) {
if (int u = subleft[q]; u <= R[q]) queries[u].push_back(q);
}
vector<set<int>> T(N);
vi ans(Q);
for (int u = 0; u < N; ++u) {
T[u].insert(r[u]);
for (auto q : queries[u]) {
int v = subright[q];
auto iter = T[u].lower_bound(l[v]);
if (iter != end(T[u]) && *iter <= r[v]) ans[q] = 1;
}
if (int v = pl[u]; v < N) {
if (size(T[v]) < size(T[u])) swap(T[v], T[u]);
T[v].merge(T[u]);
}
}
return ans;
}
