#include #include #include #include #include #include using namespace std; using i32 = int32_t; i32 read_int(void) { i32 v; cin >> v; return v; } void run(void) { const i32 n = read_int(); const i32 m = read_int(); const i32 q = read_int(); vector> g(n); for (i32 i = 0; i < m; ++i) { const i32 v = read_int() - 1; const i32 u = read_int() - 1; g[v].emplace_back(u); g[u].emplace_back(v); } vector ord(n, n); vector low(n, n); atcoder::dsu uf(n); i32 id = 0; auto dfs = [&](auto self, const i32 v, const i32 p) -> void { ord[v] = low[v] = id++; for (auto u: g[v]) { if (u == p) { continue; } if (ord[u] == n) { self(self, u, v); low[v] = min(low[v], low[u]); if (ord[v] < low[u]) { uf.merge(v, u); } } else { low[v] = min(low[v], ord[u]); } } }; for (i32 i = 0; i < n; ++i) { if (ord[i] == n) { dfs(dfs, i, n); } } vector answer{"No", "Yes"}; for (i32 i = 0; i < q; ++i) { const i32 s = read_int() - 1; const i32 t = read_int() - 1; cout << answer[uf.same(s, t)] << '\n'; } } int main(void) { cin.tie(nullptr); ios::sync_with_stdio(false); run(); return 0; }