#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector
const int mod=998244353;
// const int mod1=998244353;
// const int mod=1e9+7;
const int N=2e3+5;
int bs(vec<int>&a,int x){
int s=a.size();
int l=-1,r=s;
while(l+1<r){
int m=(l+r)/2;
if(a[m]<x) l=m;
else r=m;
}
return r;
}
bool dp[N][N];
int p[N][N];
int iter=1,itera=1;
void solve(){
int n,m,q;
cin>>n>>m>>q;
vec<vec<int>>op(n+1,{n+1});
for(int i=1;i<=m;i++){
int l,r;
cin>>l>>r;
op[r].append(l);
}
for(int i=1;i<=n;i++){
sort(all(op[i]));
}
// cout<<op[3][bs(op[3],1)]<<endl;
for(int r=1;r<=n;r++){
for(int l=1;l<=n;l++){
if((*lower_bound(all(op[r]),l))==l) dp[l][r]=1;
else{
int g=bs(op[r],l);
g=op[r][g];
if(g>r){}
elif(p[l][r-1]-p[l][g-2]>0) dp[l][r]=1;
}
p[l][r]=p[l][r-1]+dp[l][r];
}
}
// for(int i=1;i<=n;i++){
// for(int j=1;j<=n;j++){
// cout<<dp[i][j]<<' ';
// }
// cout<<endl;
// }
for(int i=1;i<=q;i++){
int l,r;
cin>>l>>r;
cout<<(dp[l][r]?"YES":"NO")<<endl;
}
}
signed main(){
// freopen("","r",stdin);
// freopen("","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<fixed<<setprecision(20);
// cin>>itera;
for(iter=1;iter<=itera;iter++) solve();
}
