#include <stdio.h>
#include <stdlib.h>

#define NUM_PRIME 4

long long p[NUM_PRIME] = {};
long long pow_k[200001][NUM_PRIME] = {};

void set_segt (long long t[][NUM_PRIME], int idx, long long val, int size) {
  int len = 1;
  idx = idx+size-1;
  for (int i = 0; i < NUM_PRIME; i++) {
    if (val < 0LL) {
      t[idx][i] = (p[i]-(val*(-1LL))%p[i])%p[i];
    } else {
      t[idx][i] = val%p[i];
    }
  }
  while (idx > 0) {
    idx = (idx-1)/2;
    for (int i = 0; i < NUM_PRIME; i++) {
      t[idx][i] = (t[2*idx+1][i]+pow_k[len][i]*t[2*idx+2][i])%p[i];
    }
    len *= 2;
  }
  
  return;
}

int sum_segt_rec (long long t[][NUM_PRIME], int a, int b, int k, int l, int r, long long *ans) {
  long long tmp[NUM_PRIME] = {};
  int len1 = 0;
  int len2 = 0;
  
  if (r <= a || b <= l) {
    for (int i = 0; i < NUM_PRIME; i++) {
      ans[i] = 0LL;
    }
    return 0;
  }
  
  if (a <= l && r <= b) {
    for (int i = 0; i < NUM_PRIME; i++) {
      ans[i] = t[k][i];
    }
    return r-l;
  }
  
  len1 = sum_segt_rec(t, a, b, 2*k+1, l, (l+r)/2, ans);
  len2 = sum_segt_rec(t, a, b, 2*k+2, (l+r)/2, r, tmp);
  
  for (int i = 0; i < NUM_PRIME; i++) {
    ans[i] += tmp[i]*pow_k[len1][i];
    ans[i] %= p[i];
  }
  
  return len1+len2;
}

int sum_segt (long long t[][NUM_PRIME], int a, int b, int size, long long *ans) {
  return sum_segt_rec(t, a, b, 0, 0, size, ans);
}

int main () {
  int n = 0;
  int q = 0;
  long long k = 0LL;
  long long a = 0LL;
  int l = 0;
  int r = 0;
  
  int res = 0;
  
  long long t[262143][NUM_PRIME] = {};
  int size = 1;
  
  srand(1);
  
  res = scanf("%d", &n);
  res = scanf("%d", &q);
  res = scanf("%lld", &k);
  for (int i = 0; i < NUM_PRIME; i++) {
    p[i] = (long long)(rand()%1000000000+1000000000);
  }
  for (int i = 0; i < NUM_PRIME; i++) {
    pow_k[0][i] = 1LL;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < NUM_PRIME; j++) {
      pow_k[i+1][j] = (pow_k[i][j]*(k%p[j]))%p[j];
    }
  }
  while (size <= n) {
    size <<= 1;
  }
  for (int i = 0; i < n; i++) {
    res = scanf("%lld", &a);
    set_segt(t, i, a, size);
  }
  while (q > 0) {
    long long ans[4] = {};
    int is_ng = 1;
    res = scanf("%d", &l);
    res = scanf("%d", &r);
    res = sum_segt(t, l-1, r, size, ans);
    for (int i = 0; i < NUM_PRIME; i++) {
      if (ans[i] > 0LL) {
        is_ng = 0;
      }
    }
    if (is_ng > 0) {
      printf("No\n");
    } else {
      printf("Yes\n");
    }
    q--;
  }
  
  return 0;
}