#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

int n,q,p;
int a[5010];

int dp[5010][5010];

void solve(){
  cin >> n >> q >> p;
  rep(i,n) cin >> a[i];
  rep(i,n){
    rep(j,p){
      dp[i][j]=mod;
    }
  }
  dp[n-1][a[n-1]]=n-1;
  per(i,n-1){
    dp[i][a[i]]=i;
    rep(j,p){
      chmin(dp[i][j],dp[i+1][j]);
      chmin(dp[i][j*a[i]%p],dp[i+1][j]);
    }
    // rep(j,p){
    //   cout << i << " " << j << " " << dp[i][j] << endl;
    // }
  }
  rep(i,q){
    int l,r,k;cin >> l >> r >> k;l--;r--;
    if(dp[l][k]<=r) cout << "Yes" << endl;
    else cout << "No" << endl;
  }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}