#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;
const int INF = 1e9;

int dp[5005][5005];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, q, p; cin >> n >> q >> p;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++){
        for(int j = 0; j < p; j++){
            dp[i][j] = -INF;
        }
    }
    dp[0][a[0]] = 0;
    for(int i = 1; i < n; i++){
        for(int j = 0; j < p; j++) dp[i][j] = dp[i-1][j];
        dp[i][a[i]] = i;
        for(int j = 0; j < p; j++){
            chmax(dp[i][(j*a[i])%p], dp[i-1][j]);
        }
    }
    while(q--){
        int l, r, k; cin >> l >> r >> k; l--; r--;
        cout << (dp[r][k] >= l ? "Yes" : "No") << endl;
    }
}