#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class S> bool chmax(S& a, const S& b) { if (a < b) { a = b; return true; } else return false; }
template<class S> bool chmin(S& a, const S& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

default_random_engine gen(chrono::system_clock::now().time_since_epoch().count());
template <int ...ids>
struct MultiMod {
  tuple<dynamic_modint<ids>...> val;
  MultiMod() = default;
  MultiMod(integral auto x) {
    (..., (get<ids>(val) = x));
  }
  friend MultiMod operator+(const MultiMod& lhs, const MultiMod& rhs) {
    MultiMod res;
    res.val = tuple((get<ids>(lhs.val) + get<ids>(rhs.val))...);
    return res;
  }
  friend MultiMod operator-(const MultiMod& lhs, const MultiMod& rhs) {
    MultiMod res;
    res.val = tuple((get<ids>(lhs.val) - get<ids>(rhs.val))...);
    return res;
  }
  friend MultiMod operator*(const MultiMod& lhs, const MultiMod& rhs) {
    MultiMod res;
    res.val = tuple((get<ids>(lhs.val) * get<ids>(rhs.val))...);
    return res;
  }
  explicit operator bool() {
    return (... || get<ids>(val).val());
  }
  static void mod_init() {
    (..., dynamic_modint<ids>::set_mod(uniform_int_distribution<>(1, 2000001000)(gen)));
  }
};

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  using S = MultiMod<0,1,2,3,4,5,6,7,8,9,10>;
  S::mod_init();
  int n, q;
  ll k_ll;
  cin >> n >> q >> k_ll;
  S k(k_ll);
  VL a(n);
  rep(i, n) cin >> a[i];
  vector<S> s(n + 1);
  rrep(i, n) {
    s[i] = s[i+1] * k + a[i];
  }
  vector<S> pow_k(n + 1);
  pow_k[0] = 1;
  rep(i, n) pow_k[i+1] = pow_k[i] * k;
  rep(_, q) {
    int l, r;
    cin >> l >> r;
    l--;
    S v = s[l] - s[r] * pow_k[r - l];
    cout << (v ? "Yes\n" : "No\n");
  }
}