/* -*- coding: utf-8 -*-
 *
 * 1349.cc:  No.1349 Subset Product Queries - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 5000;
const int MAX_P = 5000;

/* typedef */

/* global variables */

int as[MAX_N];
int dp[MAX_N + 1][MAX_P];

/* subroutines */

inline void setmax(int &a, int b) { if (a < b) a = b; }

/* main */

int main() {
  int n, q, p;
  scanf("%d%d%d", &n, &q, &p);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  memset(dp[0], -1, sizeof(dp[0]));
  for (int i = 0; i < n; i++) {
    memcpy(dp[i + 1], dp[i], sizeof(dp[i]));
    setmax(dp[i + 1][as[i]], i);

    for (int j = 0; j < p; j++)
      if (dp[i][j] >= 0)
	setmax(dp[i + 1][(j * as[i]) % p], dp[i][j]);
  }

  while (q--) {
    int li, ri, ki;
    scanf("%d%d%d", &li, &ri, &ki);
    li--;

    if (dp[ri][ki] >= li) puts("Yes");
    else puts("No");
  }

  return 0;
}