// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define endl '\n';
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define py cout << "YES" << endl;
#define pn cout << "NO" << endl;
#define pb push_back
#define int long long
typedef long double lld;
#define double lld
typedef long long ll;
typedef unsigned long long ull;
const ll inf = 1e18;
const ll mod = 1e9+7;
const int N = 2e5;
vector<int>primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
// Check for queue, priorioty_queue, stack, ordered_set solutions
// stack => LIFO (whatever goes in last comes out last)
// queue => FIFO (whatever goes in first comes out first)
// priority_queue => Dynamic queries of minimum/maximum
// ordered_set => set in vector form
//[order_of_key(k) gives number of elements less than k, while find_by_order(i) gives i^th element]
// To comment multiple lines : ctrl + /
// To find and replace : ctrl+H
void judge(){
srand(time(NULL));
#ifndef ONLINE_JUDGE
freopen("1.txt","r",stdin);
freopen("2.txt","w",stdout);
freopen("Error.txt", "w", stderr);
#define debug(x...) cerr << #x <<" = "; _print(x); cerr << endl;
#else
#define debug(x...)
#endif
}
void usaco(string s) {
freopen((s + ".in").c_str(),"r",stdin);
freopen((s + ".out").c_str(),"w",stdout);
}
vector<vector<int>>adj; vector<bool>done; int n;
void dfs(int node, vector<bitset<500000>>&vis){
if(done[node]){
return;
}
// vis[node] |= vis[node+1];
for(auto child : adj[node]){
vis[node][child] = true;
//cout << child << endl;
if(child!=node){
dfs(child,vis);
}
if(child!=n-1){
dfs(child+1,vis);
vis[node] |= vis[child+1];
}
vis[node] |= vis[child];
}
done[node] = true;
}
signed main(){
fastio; //judge();
int m,q; cin >> n >> m >> q;
adj.resize(n);
vector<bitset<500000>>vis(n);
done.resize(n);
for(int i = 0,u,v;i<m;i++){
cin >> u >> v; u--; v--;
adj[u].pb(v);
}
//py;
for(int i = 0;i<n;i++){
dfs(i,vis);
}
// for(int i = 0;i<n;i++){
// for(int j = 0;j<n;j++){
// cout << vis[i][j];
// }
// cout << endl;
// }
while(q--){
int s,e; cin >> s >> e; s--; e--;
if(vis[s][e]){
py;
}
else{
pn;
}
}
}
