#include<bits/stdc++.h>
#define N 3001
#define int long long
using namespace std;
int n, k, q, a[N], p[N], fa[N << 1], l, r;
int find(int x) {
    return x == fa[x] ? x : (fa[x] = find(fa[x]));
}

void merge(int x, int y) {
    fa[find(x)] = find(y);
}

signed main() {
	freopen("Heights.in","r",stdin);
	freopen("Heights.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> k >> q;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= 2 * k; ++j) {
            fa[j] = j;
        }
        
        bool valid = true;
        p[i] = i;
        for (int j = i + 1; j <= n && valid; ++j) {
            int x = a[j-1];
            int y = a[j];
			if (x == y) {
                valid = false;
                break;
            }
			bool w = ((j - i) % 2 == 1);

            if (w) {
                if (find(x + k) == find(y)) {
                    valid = false;
                    break;
                }
                merge(x, y + k);
            } else {
                if (find(x) == find(y + k)) {
                    valid = false;
                    break;
                }
                merge(x + k, y);
            }
            p[i] = j;
        }
    }
    while (q--) {
        cin >> l >> r;
        if (r <= p[l]) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }
    }

    return 0;
}