import sys

def main():
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr]); ptr +=1
    Q = int(input[ptr]); ptr +=1
    P = int(input[ptr]); ptr +=1
    
    A = list(map(int, input[ptr:ptr+N]))
    ptr += N
    
    # Precompute prefix sum of zeros
    prefix_zero = [0] * (N + 1)
    for i in range(1, N+1):
        prefix_zero[i] = prefix_zero[i-1] + (1 if A[i-1] == 0 else 0)
    
    for _ in range(Q):
        L = int(input[ptr]); ptr +=1
        R = int(input[ptr]); ptr +=1
        K = int(input[ptr]); ptr +=1
        
        if K == 0:
            zeros = prefix_zero[R] - prefix_zero[L-1]
            print("Yes" if zeros > 0 else "No")
            continue
        
        # Collect non-zero elements in [L, R]
        non_zero = []
        for i in range(L-1, R):
            a = A[i]
            if a != 0:
                non_zero.append(a % P)
        
        if not non_zero:
            print("No")
            continue
        
        possible = set()
        found = False
        for a in non_zero:
            a_mod = a % P
            new_possible = {a_mod}
            for s in possible:
                new_s = (s * a_mod) % P
                new_possible.add(new_s)
            # Update possible
            for s in new_possible:
                if s not in possible:
                    possible.add(s)
            if K in possible:
                found = True
                break
        print("Yes" if found else "No")

if __name__ == "__main__":
    main()