#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

template<class V> class MaxFlow_dinic {
public:
	struct edge { int to,reve;V cap;};
	static const int MV = 202020;
	vector<edge> E[MV];
	int itr[MV],lev[MV];
	void add_edge(int x,int y,V cap,bool undir=false) {
		E[x].push_back((edge){y,(int)E[y].size(),cap});
		E[y].push_back((edge){x,(int)E[x].size()-1,undir?cap:0});
	}
	void bfs(int cur) {
		MINUS(lev);
		queue<int> q;
		lev[cur]=0;
		q.push(cur);
		while(q.size()) {
			int v=q.front(); q.pop();
			FORR(e,E[v]) if(e.cap>0 && lev[e.to]<0) lev[e.to]=lev[v]+1, q.push(e.to);
		}
	}
	V dfs(int from,int to,V cf) {
		if(from==to) return cf;
		for(;itr[from]<E[from].size();itr[from]++) {
			edge* e=&E[from][itr[from]];
			if(e->cap>0 && lev[from]<lev[e->to]) {
				V f=dfs(e->to,to,min(cf,e->cap));
				if(f>0) {
					e->cap-=f;
					E[e->to][e->reve].cap += f;
					return f;
				}
			}
		}
		return 0;
	}
	V maxflow(int from, int to) {
		V fl=0,tf;
		while(1) {
			bfs(from);
			if(lev[to]<0) return fl;
			ZERO(itr);
			while((tf=dfs(from,to,numeric_limits<V>::max()))>0) fl+=tf;
		}
	}
};

int N,M,L;
int S[101010],T[101010];
map<pair<int,int>,int> E;
int ret[101010];

MaxFlow_dinic<int> mf;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M>>L;
	FOR(i,N) mf.add_edge(N+M,i,1);
	FOR(i,M) mf.add_edge(N+i,N+M+1,1);
	FOR(i,L) {
		cin>>S[i]>>T[i];
		S[i]--,T[i]--;
		E[{S[i],T[i]}]=i;
		mf.add_edge(S[i],N+T[i],1);
	}
	int ma=mf.maxflow(N+M,N+M+1);
	vector<int> cand;
	FOR(i,N) {
		FORR(e,mf.E[i]) if(e.to<N+M) {
			x=E[{i,e.to-N}];
			if(e.cap==1) ret[x]=1;
			else cand.push_back(x);
		}
	}
	FORR(c,cand) {
		MaxFlow_dinic<int> mf2=mf;
		mf2.E[N+M][S[c]].cap=1;
		mf2.E[S[c]][0].cap=0;
		mf2.E[N+T[c]][0].cap=1;
		mf2.E[N+M+1][T[c]].cap=0;
		
		
		FORR(e,mf2.E[N+T[c]]) if(e.to==S[c]) e.cap=0;
		ret[c]=mf2.maxflow(N+M,N+M+1);
	}
	
	
	FOR(i,L) {
		if(ret[i]) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}