import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MS = [1100000009, 1100000017, 1100000051, 1100000059, 1100000081, 
1100000123, 1100000149, 1100000159, 1100000177, 1100000179];
enum H = cast(int)(MS.length);

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const Q = readInt;
      const K = readLong;
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong;
      }
      auto L = new int[Q];
      auto R = new int[Q];
      foreach (q; 0 .. Q) {
        L[q] = readInt - 1;
        R[q] = readInt;
      }
      
      auto KK = new long[][](H, N + 1);
      auto fss = new long[][](H, N + 1);
      foreach (h; 0 .. H) {
        KK[h][0] = 1;
        foreach (i; 1 .. N + 1) {
          KK[h][i] = KK[h][i - 1] * K;
        }
        foreach_reverse (i; 0 .. N) {
          fss[h][i] = (A[i] + K * fss[h][i + 1]) % MS[h];
        }
      }
      
      foreach (q; 0 .. Q) {
        bool ans;
        foreach (h; 0 .. H) {
          long val = (fss[h][L[q]] - KK[h][R[q] - L[q]] * fss[h][R[q]]) % MS[h];
          ans = ans || val;
        }
        writeln(ans ? "Yes" : "No");
      }
    }
  } catch (EOFException e) {
  }
}