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

const int MAX_N = 1005;
const int MAX_P = 105;
const int MAX_Q = 100005;
using ll = long long;

int N, Q, P;
vector<ll> A(MAX_N);
vector<int> L(MAX_Q), R(MAX_Q), K(MAX_Q);
vector<vector<bool>> dp(MAX_N, vector<bool>(MAX_P, false));

void preprocess() {
    dp[0][1] = true; 
    for (int i = 1; i <= N; i++) {
        
        for (int k = 0; k < P; k++) {
            dp[i][k] = dp[i][k] |dp[i-1][k];
        }
        
        for (int k = 0; k < P; k++) {
            if (dp[i-1][k]) {
                dp[i][(k * A[i]) % P] = true;
            }
        }
    }
}


bool check_segment(int left, int right, int K) {
    
    if (!dp[right][K]) return false;
    
    if (left == 1) return true;
    
    vector<vector<bool>> dp2(right - left + 2, vector<bool>(P, false));
    dp2[0][1] = true; 
    for (int i = left; i <= right; i++) {
        int idx = i - left + 1;
        
        for (int k = 0; k < P; k++) {
            dp2[idx][k] = dp2[idx][k]|dp2[idx-1][k];
        }
        
        for (int k = 0; k < P; k++) {
            if (dp2[idx-1][k]) {
                dp2[idx][(k * A[i]) % P] = true;
            }
        }
    }
    return dp2[right - left + 1][K];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> N >> Q >> P;
    for (int i = 1; i <= N; i++) {
        cin >> A[i];
    }
    for (int i = 1; i <= Q; i++) {
        cin >> L[i] >> R[i] >> K[i];
    }

    
    preprocess();

    
    int valid_queries = 0;
    for (int i = 1; i <= Q; i++) {
        if (check_segment(L[i], R[i], K[i])) {
            cout<<"Yes"<<endl;
        }
        else
            cout<<"No"<<endl;
    }

    
   // cout << valid_queries << endl;

    return 0;
}