#include <bits/stdc++.h>
//#include<atcoder/fenwicktree>
//using namespace atcoder;
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}
ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;
}


/*
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;


vector<mint> fact, factinv, inv;
const ll mod = 998244353;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}

vvm mul(vvm A, vvm B) {
    ll n = A.size();
    vvm res(n, vm(n, 0));
    rep(i, n)rep(j, n)rep(k, n)res[i][j] += A[i][k] * B[k][j];
    return res;
}
*/

bool DEB = 0;


using i128=__int128_t;
i128 pow_mod_128(i128 A, i128 N, i128 M) {
    i128 res = 1 % M;
    A %= M;
    while (N>0) {
        if (N%2==1) res = (res * A) % M;
        A = (A * A) % M;
        N/=2;
    }
    return res;
}
bool is_prime(ll N) {
    if (N <= 1) return 0;
    if (N == 2) return 1;
    if (N % 2 == 0) return 0;
    vll A = {2,325,9375,28178,450775,9780504,1795265022};
    ll s = 0, d = N - 1;
    while (d % 2 == 0) {
        s++;
        d/=2;
    }
    for (auto a : A) {
        if (a % N == 0) return 1;
        ll t, x = pow_mod_128(a, d, N);
        if (x != 1) {
            for (t = 0; t < s; ++t) {
                if (x == N - 1) break;
                x = (i128(x) * x) % N;
            }
            if (t == s) return 0;
        }
    }
    return 1;
}


int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N,Q,K;
    cin>>N>>Q>>K;
    ll PN=5;
    vll P;
    rep(i,PN){
        ll p=1;
        while(p<1e8||!is_prime(p))p=rand()%ll(1e9);
        P.push_back(p);
    }
    vvll D(N+1,vll(5,0));
    vll KP(PN,1);
    rep(i,N){
        
        ll A;
        cin>>A;
        rep(j,PN){
            D[i+1][j]=(D[i][j]+(A%P[j])*KP[j])%P[j];
            if(D[i+1][j]<0)D[i+1][j]+=P[j];
            KP[j]*=(K%P[j]);
            KP[j]%=P[j];
        }
    }
    rep(q,Q){
        ll L,R;
        cin>>L>>R;
        L--;
        bool OK=1;
        rep(j,PN)if(D[R][j]!=D[L][j])OK=0;
        cout<<(OK?"No":"Yes")<<endl;
    }
}