#include <iostream>

using namespace std;

using ll = long long;

constexpr int Z[3] = {(int)1e9-71, (int)1e9+7, (int)1e9+9};

int main() {
    int n, q;
    ll k;
    cin >> n >> q >> k;
    int ps[n+1][3];
    ps[0][0] = ps[0][1] = ps[0][2] = 0;
    int powk[3] = {1, 1, 1};
    for (int i = 1; i <= n; i++) {
        ll a;
        cin >> a;
        for (int j = 0; j < 3; j++) {
            int moda = (a % Z[j] + Z[j]) % Z[j];
            ps[i][j] = (ps[i-1][j] + 1ll * moda * powk[j]) % Z[j];
            powk[j] = powk[j] * (k % Z[j]) % Z[j];
        }
    }

    while (q--) {
        int l, r;
        cin >> l >> r;

        bool ans = false;
        for (int j = 0; j < 3; j++) {
            if ((ps[r][j] - ps[l-1][j] + Z[j]) % Z[j] != 0) {
                ans = true;
            }
        }

        cout << (ans ? "Yes" : "No") << endl;
    }

    return 0;
}