#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define int long long
#define fi first
#define se second
const int N = 3e5 + 5, M = 1e9 + 7, LG = 20;
int n , A[N] , k , q , l , r , lp[N];
map<pair<int,int> , int> mp , ch , pr;
void solve(){
cin >> n >> k >> q;
for (int i=1 ; i<=n ; i++){
cin >> A[i];
}
for (int i=1 ; i<n ; i++){
if (A[i] == A[i+1]){
lp[i] = lp[i-1] + 1;
}else{
lp[i] = lp[i-1];
}
}
while(q--){
cin >> l >> r;
if (lp[r-1] - lp[l-1]){
cout << "NO" << endl;
}else{
cout << "YES" << endl;
}
}
}
signed main(){
// freopen("" , "r" , stdin);
// freopen("" , "w" , stdout);
// cout << setprecision(30);
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ts = 1;
// cin >> ts;
while(ts--){
solve();
}
}
