#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void*wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  (*arr)=(T*)(*mem);
  (*mem)=((*arr)+x);
}
template<class T> inline void walloc1d(T **arr, int x1, int x2, void **mem = &wmem){
  walloc1d(arr, x2-x1, mem);
  (*arr) -= x1;
}
template<class T1, class T2, class T3> void sortA_L(int N, T1 a[], T2 b[], T3 c[], void *mem = wmem){
  int i;
  pair<T1, pair<T2, T3> >*arr;
  walloc1d(&arr, N, &mem);
  for(i=(0);i<(N);i++){
    arr[i].first = a[i];
    arr[i].second.first = b[i];
    arr[i].second.second = c[i];
  }
  sort(arr, arr+N);
  for(i=(0);i<(N);i++){
    a[i] = arr[i].first;
    b[i] = arr[i].second.first;
    c[i] = arr[i].second.second;
  }
}
template<class T1, class T2, class T3, class T4> void sortA_L(int N, T1 a[], T2 b[], T3 c[], T4 d[], void *mem = wmem){
  int i;
  pair<pair<T1, T2>, pair<T3, T4> >*arr;
  walloc1d(&arr, N, &mem);
  for(i=(0);i<(N);i++){
    arr[i].first.first = a[i];
    arr[i].first.second = b[i];
    arr[i].second.first = c[i];
    arr[i].second.second = d[i];
  }
  sort(arr, arr+N);
  for(i=(0);i<(N);i++){
    a[i] = arr[i].first.first;
    b[i] = arr[i].first.second;
    c[i] = arr[i].second.first;
    d[i] = arr[i].second.second;
  }
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(const char c[]){
  int i=0;
  for(i=0;c[i]!='\0';i++){
    my_putchar_unlocked(c[i]);
  }
}
template<class S, class T> inline S chmax(S &a, T b){
  if(a<b){
    a=b;
  }
  return a;
}
int N;
int Q;
int P;
int A[5000];
int L[200000];
int R[200000];
int K[200000];
int ind[200000];
int res[200000];
int f[5000];
int nx[5000];
int main(){
  wmem = memarr;
  int i;
  int j;
  int k;
  int q = 0;
  int x;
  int m;
  rd(N);
  rd(Q);
  rd(P);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  {
    int e98WHCEY;
    for(e98WHCEY=(0);e98WHCEY<(Q);e98WHCEY++){
      rd(L[e98WHCEY]);L[e98WHCEY] += (-1);
      rd(R[e98WHCEY]);R[e98WHCEY] += (-1);
      rd(K[e98WHCEY]);
    }
  }
  for(i=(0);i<(Q);i++){
    ind[i] = i;
  }
  sortA_L(Q, R, L, K, ind);
  for(j=(0);j<(P);j++){
    f[j] = -1;
  }
  for(i=(0);i<(N);i++){
    for(j=(0);j<(P);j++){
      nx[j] = f[j];
    }
    for(j=(0);j<(P);j++){
      chmax(f[j*A[i]%P], nx[j]);
    }
    chmax(f[A[i]], i);
    while(q < Q && R[q] == i){
      if(f[K[q]] >= L[q]){
        res[ind[q]] = 1;
      }
      q++;
    }
  }
  for(i=(0);i<(Q);i++){
    if(res[i]){
      wt_L("Yes");
      wt_L('\n');
    }
    else{
      wt_L("No");
      wt_L('\n');
    }
  }
  return 0;
}
// cLay version 20210103-1 [bug fixed 1]

// --- original code ---
// int N, Q, P, A[5000], L[2d5], R[2d5], K[2d5], ind[2d5], res[2d5];
// int f[5000], nx[5000];
// {
//   int i, j, k, q = 0, x, m;
//   rd(N,Q,P,A(N),(L--,R--,K)(Q));
//   rep(i,Q) ind[i] = i;
//   sortA(Q, R, L, K, ind);
// 
//   rep(j,P) f[j] = -1;
//   rep(i,N){
//     rep(j,P) nx[j] = f[j];
//     rep(j,P) f[j*A[i]%P] >?= nx[j];
//     f[A[i]] >?= i;
//     while(q < Q && R[q] == i){
//       if(f[K[q]] >= L[q]) res[ind[q]] = 1;
//       q++;
//     }
//   }
// 
//   rep(i,Q) wt(if[res[i], "Yes", "No"]);
// }