// >>> TEMPLATES #include using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; #define int ll #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep1(i, n) for (int i = 1; i <= (int)(n); i++) #define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i, n) for (int i = (int)(n); i >= 1; i--) #define loop(i, a, B) for (int i = a; i B; i++) #define loopR(i, a, B) for (int i = a; i B; i--) #define all(x) begin(x), end(x) #define allR(x) rbegin(x), rend(x) #define rng(x, l, r) begin(x) + (l), begin(x) + (r) #define pb push_back #define eb emplace_back #define fst first #define snd second template constexpr auto mp(A &&a, B &&b) { return make_pair(forward(a), forward(b)); } template constexpr auto mt(T&&... x) { return make_tuple(forward(x)...); } template auto constexpr inf_ = numeric_limits::max()/2-1; auto constexpr INF32 = inf_; auto constexpr INF64 = inf_; auto constexpr INF = inf_; #ifdef LOCAL #include "debug.hpp" #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template struct pque : priority_queue, Comp> { vector &data() { return this->c; } void clear() { this->c.clear(); } }; template using pque_max = pque>; template using pque_min = pque>; template ::value, int> = 0> ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template ::value, int> = 0> ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template ())), class = typename enable_if::value>::type> istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; } template ostream& operator<<(ostream& os, pair const& p) { return os << p.first << " " << p.second; } template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward(f)) {} template constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward(x)...); } }; struct MakeFixPoint { template constexpr auto operator|(F&& f) const { return FixPoint(forward(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template struct vec_impl { using type = vector::type>; template static type make_v(size_t n, U&&... x) { return type(n, vec_impl::make_v(forward(x)...)); } }; template struct vec_impl { using type = T; static type make_v(T const& x = {}) { return x; } }; template using vec = typename vec_impl::type; template auto make_v(Args&&... args) { return vec_impl::make_v(forward(args)...); } template void quit(T const& x) { cout << x << endl; exit(0); } template constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; } template constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; } template constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits::value_type{}); } template int sz(T const& x) { return x.size(); } template int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); } template int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); } constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; } constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); } constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); } constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 }; constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 }; constexpr int popcnt(ll x) { return __builtin_popcountll(x); } mt19937_64 seed_{random_device{}()}; template Int rand(Int a, Int b) { return uniform_int_distribution(a, b)(seed_); } i64 irand(i64 a, i64 b) { return rand(a, b); } // [a, b] u64 urand(u64 a, u64 b) { return rand(a, b); } // template void shuffle(It l, It r) { shuffle(l, r, seed_); } template V &operator--(V &v) { for (auto &x : v) --x; return v; } template V &operator++(V &v) { for (auto &x : v) ++x; return v; } // <<< // >>> bipartite matching struct BMatching { vector used, p, q; vector> g; BMatching(int L, int R) : used(L, 0), p(L, -1), q(R, -1), g(L) {} void add_edge(int x, int y) { g[x].push_back(y);} bool dfs(int32_t x) { if (used[x]) return false; used[x] = 1; for (int y : g[x]) { if (q[y] < 0 or dfs(q[y])) { p[x] = y, q[y] = x; return true; } } return false; } int run() { int match = 0, update = 1; while (update) { update = 0; fill(used.begin(), used.end(), 0); rep (i, p.size()) if (p[i] < 0 and dfs(i)) update = 1, ++match; } return match; } }; // <<< // >>> scc #ifndef EDGE_INFO #define EDGE_INFO constexpr int dest(int v) { return v; } template ().to)> constexpr int dest(E const& e) { return e.to; } constexpr int cost(int) { return 1; } template ().cost)> constexpr auto cost(E const& e) { return e.cost; } template using cost_t = decltype(cost(declval())); #endif template struct SCC { vector> const& g; vector ord, low, st; int32_t time = 0, pos = 0, sz = 0; SCC(vector> const& g) : g(g), ord(g.size()), low(g.size()), st(g.size()) { rep (v, g.size()) if (ord[v] == 0) dfs(v); for (auto &x : ord) x += sz; } void dfs(int32_t v) { low[v] = ord[v] = ++time; st[pos++] = v; for (auto const& e : g[v]) { if (ord[dest(e)] == 0) { dfs(dest(e)); chmin(low[v], low[dest(e)]); } else if (ord[dest(e)] > 0) { chmin(low[v], ord[dest(e)]); } } if (low[v] == ord[v]) { sz++; do ord[st[--pos]] = -sz; while (st[pos] != v); } } // t-sorted id int id(int v) const { return ord[v]; } int size() const { return sz; } vector> groups() const { vector> grp(sz); rep (v, g.size()) grp[ord[v]].push_back(v); return grp; } // no multiple edges, no self-loops // no edge information vector> graph() const { vector> ret(size()); vector last(g.size(), -1); rep (v, g.size()) { for (auto const& e : g[v]) { const int32_t x = id(v), y = id(dest(e)); if (x == y or last[y] == x) continue; last[y] = x; ret[x].push_back(y); } } return ret; } }; template auto get_scc(vector> const& g) { return SCC(g); } // <<< int32_t main() { int n, m, L; cin >> n >> m >> L; vector s(L), t(L); rep (i, L) cin >> s[i] >> t[i], --s[i], --t[i]; BMatching bm(n, m); rep (i, L) bm.add_edge(s[i], t[i]); bm.run(); vector> es; rep (i, L) es.eb(s[i], n+t[i]); rep (i, n) { int j = bm.p[i]; if (j >= 0) es.eb(n+j, i); } dump(es); vector> g(n+m), rg(n+m); for (auto [x, y] : es) { g[x].eb(y); rg[y].eb(x); } vector used0(n+m), used1(n+m); { def (dfs, int x) -> void { used0[x] = true; for (int y : g[x]) { if (not used0[y]) dfs(y); } }; rep (i, n) if (bm.p[i] < 0) dfs(i); } { def (dfs, int x) -> void { used1[x] = true; for (int y : rg[x]) { if (not used1[y]) dfs(y); } }; rep (j, m) if (bm.q[j] < 0) dfs(n+j); } dump(used0); dump(used1); vector> G(n+m); for (auto [x, y] : es) { if (not used0[x] and not used1[x] and not used0[y] and not used1[y]) { G[x].eb(y); } } auto scc = get_scc(G); auto grp = scc.groups(); dump(grp); vector bad(n+m); rep (I, scc.size()) { if (sz(grp[I]) == 2) { int x = grp[I][0]; int y = grp[I][1]; bad[x] = bad[y] = true; } } rep (i, L) { int x = s[i], y = n+t[i]; if (not used0[x] and not used1[x] and scc.id(x) != scc.id(y)) { cout << "No" << '\n'; } else { cout << "Yes" << '\n'; } } }