import java.util.*; import java.io.*; public class Main { static FastScanner sc = new FastScanner(System.in); static PrintWriter pw = new PrintWriter(System.out); static StringBuilder sb = new StringBuilder(); static long mod = (long)1e9+7; static long mod2 = 998244353; public static void main(String[] args) throws Exception { solve(); pw.flush(); } public static void solve(){ int N = sc.nextInt(); int Q = sc.nextInt(); long K = sc.nextLong(); long[] A = sc.nextLongArray(N); ArrayList Query = new ArrayList<>(); for(int i = 0; i < Q; i++){ Query.add(new int[]{sc.nextInt(),sc.nextInt()}); } boolean[] check1 = check(A,Query,K,mod,N); boolean[] check2 = check(A,Query,K,mod2,N); for(int i = 0; i < Q; i++){ if(check1[i] || check2[i]){ pw.println("Yes"); }else{ pw.println("No"); } } } static boolean[] check(long[] A, ArrayList Query, long K, long mod, int N){ int Q = Query.size(); boolean[] ret = new boolean[Q]; K %= mod; long[] sum = new long[N+1]; long now = 1; for(int i = 0; i < N; i++){ long v = A[i]; if(v < 0){ long p = (Math.abs(v)+mod-1)/mod; v += p*mod; v %= mod; }else{ v %= mod; } sum[i+1] += (sum[i]+(v*now))%mod; now *= K; now %= mod; } for(int i = 0; i < Q; i++){ int l = Query.get(i)[0]-1; int r = Query.get(i)[1]; if(sum[r] - sum[l] != 0){ ret[i] = true; }else{ ret[i] = false; } } return ret; } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } public static void save_sort(long[] array) { shuffle(array); Arrays.sort(array); } public static long[] shuffle(long[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); long randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public FastScanner(FileReader in) { reader = new BufferedReader(in); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }