// #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+1),a2(n+1);
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;
// }
c=0;
int j=0;
map<int,int>d1,d2;
int v=1;
vector<int>i1,i2;
for (int i=1;i<=n;i++){
c+=a1[i];
c-=a2[i];
if (a1[i]){
i1.push_back(i);
}
if (a2[i]){
i2.push_back(i);
}
if (!c){
for (int j:i1){
d1[j]=v;
}
for (int j:i2){
d2[j]=v;
}
i1.clear();
i2.clear();
v++;
}
}
for (int j:i1){
d1[j]=v;
}
for (int j:i2){
d2[j]=v;
}
i1.clear();
i2.clear();
v++;
for (int i=0;i<q;i++){
cin >> x >> y;
if (d1[x]==d2[y] and d1[x]){
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++;
}
}
