from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline


class SegTree:
    """
    Segment Tree
    """

    def __init__(self, init_val, segfunc, ide_ele):
        """
        初期化

        init_val: 配列の初期値
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        """
        k番目の値をxに更新

        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            tk = k>>1
            self.tree[tk] = self.segfunc(self.tree[tk<<1], self.tree[(tk<<1)+1])
            k >>= 1

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る

        l: index(0-index)
        r: index(0-index)
        """
        res_l = self.ide_ele
        res_r = self.ide_ele
        
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res_l = self.segfunc(res_l, self.tree[l])
                l += 1
            if r & 1:
                res_r = self.segfunc(self.tree[r - 1], res_r)
            l >>= 1
            r >>= 1
        res = self.segfunc(res_l,res_r)
        return res
    

N,Q,k = map(int,input().split())
A = list(map(int,input().split()))

mods = [998244353, 
        10**9 + 7,
        897581057]
m0,m1,m2 = mods

ide_ele = (0,0,0,0)
def f(x,y):


    x0,x1,x2,l0 = x
    y0,y1,y2,r0 = y

    z0 = (x0 + y0*pow(k,l0,m0))%m0
    z1 = (x1 + y1*pow(k,l0,m1))%m1
    z2 = (x2 + y2*pow(k,l0,m2))%m2

    return (z0,z1,z2,l0+r0)

T = SegTree([(a,a,a,1) for a in A],f,ide_ele)
for _ in range(Q):

    l,r = map(int,input().split())
    l -= 1
    v0,v1,v2,__ = T.query(l,r)
    if max(v0,v1,v2)>0:
        print('Yes')
    else:
        print('No')