/** * author: otera * created: 17.11.2021 03:10:52 **/ #include #include #include using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; using uint = unsigned; #define repa(i, n) for(int i = 0; i < n; ++ i) #define repb(i, a, b) for(int i = a; i < b; ++ i) #define repc(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__) #define rep1a(i, n) for(int i = 0; i <= n; ++ i) #define rep1b(i, a, b) for(int i = a; i <= b; ++ i) #define rep1c(i, a, b, c) for(int i = a; i <= b; i += c) #define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__) #define per(i,n) for(int i=n-1;i>=0;i--) #define per1(i,n) for(int i=n;i>=1;i--) typedef pair P; typedef pair LP; #define pb push_back #define eb emplace_back #define fr first #define sc second #define all(c) c.begin(),c.end() #define lb(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define ub(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define Sort(a) sort(all(a)) #define Rev(a) reverse(all(a)) #define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a)) #define si(c) (int)(c).size() inline ll popcnt(ull a){ return __builtin_popcountll(a); } #define tpow(n) (1LL<<(n)) #define unless(A) if(!(A)) ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;in(__VA_ARGS__) #define vec(type,name,...) vectorname(__VA_ARGS__) #define VEC(type,name,size) vectorname(size);in(name) #define vv(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define VV(type,name,h,w) vector>name(h,vector(w));in(name) #define vvv(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using pq = priority_queue; template using pqg = priority_queue, greater>; template void scan(T& a){ cin >> a; } template void scan(vector& a){ for(auto&& i : a) scan(i); } void in(){} template void in(Head& head, Tail&... tail){ scan(head); in(tail...); } void print(){ cout << ' '; } template void print(const T& a){ cout << a; } template void print(const vector& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } } int out(){ cout << '\n'; return 0; } template int out(const T& t){ print(t); cout << '\n'; return 0; } template int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; } #define CHOOSE(a) CHOOSE2 a #define CHOOSE2(a0,a1,a2,a3,a4,x,...) x #define debug_1(x1) cout<<#x1<<": "< g, vc check, vc& can) { queue que; assert(si(check) == si(can)); rep(i, n + m) { if(!check[i]) { que.push(i); can[i] = 1; } } while(que.size()) { int v = que.front(); que.pop(); for(int nv: g[v]) { if(!can[nv]) { can[nv] = 1; que.push(nv); } } } } void solve() { in(n, m); INT(l); vc a(l), b(l); vvc g(n + m), rg(n + m); rep(i, l) { in(a[i], b[i]); -- a[i], -- b[i]; g[a[i]].eb(b[i] + n); rg[b[i] + n].eb(a[i]); } atcoder::mf_graph mfg(n + m + 2); int s = n + m, t = n + m + 1; rep(i, n) { mfg.add_edge(s, i, 1); } rep(j, m) { mfg.add_edge(j + n, t, 1); } rep(i, l) { mfg.add_edge(a[i], b[i] + n, 1); } mfg.flow(s, t); atcoder::scc_graph sccg(n + m); rep(i, l) { sccg.add_edge(a[i], b[i] + n); } auto edges = mfg.edges(); vc matched(n + m); for(auto e: edges) { if(e.from == s || e.to == t || e.flow == 0) continue; int x = e.from, y = e.to; sccg.add_edge(y, x); matched[x] = matched[y] = 1; g[y].eb(x); rg[x].eb(y); } vc can_reach_from_unmatched(n + m); vc can_reach_to_unmatched(n + m); calc(g, matched, can_reach_from_unmatched); calc(rg, matched, can_reach_to_unmatched); rep(i, n + m) { if(!matched[i]) { can_reach_from_unmatched[i] = can_reach_to_unmatched[i] = 1; } } auto li = sccg.scc(); vc num(n + m); int now = 0; vc sz(si(li)); for(auto vs: li) { sz[now] = si(vs); for(int v: vs) { num[v] = now; } ++ now; } rep(i, l) { if(can_reach_to_unmatched[a[i]]) { out("Yes"); } else if(can_reach_from_unmatched[a[i]]) { out("Yes"); } else if(num[a[i]] != num[b[i] + n]) { out("No"); } else { out("Yes"); } } } signed main() { ios::sync_with_stdio(false); cin.tie(0); // cout << fixed << setprecision(20); // INT(t); rep(i, t)solve(); solve(); return 0; }