#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
}
void phongbeo();
const int inf = 1e14;
const ll mod2 = 1e9+7;
const int mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
if(x+y>=mod2) x-=mod2;
if(x+y<0)x+=mod2;
return x+y;
}
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c;
};
struct id
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,lim,w,l,r,ans ;
int kk;
int el = 19;
main()
{
if(fopen(task2".inp","r"))
{
fin(task2);
fou(task2);
}
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
//modwwe
phongbeo();
// checktime
}
vector<int> v[3001];
int c[3001];
int a[3001];
int pos[3001];
bool de=0;
void dfs(int x)
{
c[x]=1;
for(auto f:v[x])
{
if(c[f]==1)
{
de=0;
}
if(c[f]) continue;
dfs(f);
}
c[x]=2;
}
bool check(int x,int y)
{
for(int i=1; i<=k; i++)
c[i]=0,v[i].clear();
for(int i=x; i<=y; i+=2)
{
if(i!=x)v[a[i]].pb(a[i-1]);
if(i!=y)v[a[i]].pb(a[i+1]);
}
de=1;
for(int i=1; i<=k; i++)
if(!c[i])
dfs(i);
return de;
}
void phongbeo()
{
cin>>n>>k>>m;
for(int i=1; i<=n; i++)
cin>>a[i];
l=1;
for(int i=1; i<=n; i++)
{
while(!check(l,i))l++;
pos[i]=l;
}
for(int i=1; i<=m; i++)
{
cin>>l>>r;
if(pos[r]<=l) cout<<"YES";
else cout<<"NO";
down
}
}
