// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=998244353;
const int inf = 1e14;
const int LOG=20;
const int N=3e5+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
void solve()
{
cin >> n >> m >> q;
vector<int>a1(n+2),a2(n+2);
vector<pair<int,int>>a(m);
for (int i=0;i<m;i++){
cin >> x >> y;
a[i]={x,y};
a1[x]++;
a2[y]++;
}
// sort(a.begin(),a.end());
// for (int i=0;i<m;i++){
// cout << a[i].fi << " " << a[i].se << endl;
// }
vector<pair<int,int>>qu(q);
bool f=1;
for (int i=0;i<q;i++){
cin >> qu[i].fi >> qu[i].se;
if (qu[i].fi!=1)f=0;
}
if (f){
map<int,int>d;
c=0;
vector<int>v;
for (int i=1;i<=n+1;i++){
c+=a1[i];
c-=a2[i-1];
if (a2[i-1]){
v.push_back(i-1);
}
if (!c)break;
}
for (int i:v){
d[i]=1;
}
for (int i=0;i<q;i++){
if (d[qu[i].se]){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
}
}
signed main()
{
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
cout << fixed << setprecision(9);
srand(time(0));
// int t=1;
// cin >> t;
for (int _=1;_<=t;_++){
solve();
q++;
}
}
