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

int main() {
    int N, P, Q;
    cin >> N >> Q >> P;
    vector<int> A(N+1);
    for (int i = 1; i <= N; ++i) cin >> A[i];
    vector<vector<int>> dp(N+1,vector<int>(P,-1));
    for(int i=1;i<=N;i++)
        {
            dp[i][A[i]%P]=max(dp[i][A[i]%P],i);
            for(int j=0;j<P;j++)
            {
                dp[i][j]=max(dp[i][j],dp[i-1][j]);
                dp[i][(j*A[i])%P] = max(dp[i][(j*A[i])%P],dp[i-1][j]);
            }
        }
    int ans=0;
    while (Q--) {
        int L, R, K;
        cin >> L >> R >> K;
        
        if(dp[R][K]>=L) cout<<"Yes\n";
        else cout<<"No\n";
    }
    //cout<<ans;
    return 0;
}