n,m,x = map(int,input().split())
a = [int(num) for num in input().split()]
mina = 1
maxa = n
def findyi(c,d):
    if c<mina or d>maxa:
        return 1
    i = c - 1   
    while i<d:
        i += 1
        if a[i-1]^x in a[i:d]:
            return 1
            break
    return 0
while n>0:
    n -= 1
    c,d = map(int,input().split())
    if findyi(c,d):
        mina = max(mina,c)
        maxa = min(maxa,d)
        print('yes')
    else:
        print('no')