#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, P, Q;
    cin >> N >> Q >> P;
    vector<int> A(N);
    for (int i = 0; i < N; ++i) cin >> A[i];

    while (Q--) {
        int L, R, K;
        cin >> L >> R >> K;
        --L; --R;  
        int len = R - L + 1;
        bool found = false;

        for (int mask = 1; mask < (1 << len); ++mask) {
            long long prod = 1;
            for (int i = 0; i < len; ++i) {
                if (mask & (1 << i)) {
                    prod = (prod * A[L + i]) % P;
                }
            }
            if (prod == K) {
                found = true;
                break;
            }
        }
        cout << (found ? "Yes" : "No") << '\n';
    }
    return 0;
}