#pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")

#include<iostream>
#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<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
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 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++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

int calc[5000][5000];
int transid[5000][5000];

bool ldp[5001][5000];
bool rdp[5001][5000];
void solve() {
	int n, q, p; cin >> n >> q >> p;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	vector<vector<int>> qs(n);
	vector<int> l(q), r(q), k(q);
	rep(i, q) {
		cin >> l[i] >> r[i] >> k[i];
		l[i]--; r[i]--;
		qs[l[i]].push_back(r[i]);
		transid[l[i]][r[i]] = i;
	}
	vector<bool> ans(q);
	vector<vector<P>> ch(p);
	rep(i, p)rep(j, p) {
		calc[i][j] = i * j % p;
		ch[(i * j) % p].push_back({ i,j });
	}
	//[le,ri)
	function<void(int, int)> yaru = [&](int le, int ri) {
		vector<int> ids;
		if (le + 1 == ri) {
			int lid = lower_bound(all(qs[le]), le) - qs[le].begin();
			while (lid < qs[le].size() && qs[le][lid] < ri) {
				ids.push_back(transid[le][qs[le][lid]]); lid++;
			}
			for (int id : ids) {
				if (a[le] == k[id])ans[id] = true;
			}
			return;
		}
		int m = (le + ri) / 2;
		yaru(le, m); yaru(m, ri);
		for (int j = m; j < ri; j++) {
			rep(k, p) {
				rdp[j - m + 1][k] = false;
			}
		}
		for (int j = m - 1; j >= le; j--) {
			rep(k, p) {
				ldp[m - j][k] = false;
			}
		}
		for (int j = m; j < ri; j++) {
			rep(k, p) {
				if (rdp[j - m][k]) {
					rdp[j - m + 1][k] = true;
					rdp[j - m + 1][calc[k][a[j]]] = true;
				}
			}
			rdp[j - m + 1][a[j]] = true;
		}
		for (int j = m - 1; j >= le; j--) {
			rep(k, p) {
				if (ldp[m - 1 - j][k]) {
					ldp[m - j][k] = true;
					ldp[m - j][calc[k][a[j]]] = true;
				}
			}
			ldp[m - j][a[j]] = true;
		}
		for (int j = le; j < m; j++) {
			int id = lower_bound(all(qs[j]), m) - qs[j].begin();
			while (id < qs[j].size() && qs[j][id] < ri) {
				ids.push_back(transid[j][qs[j][id]]);
				id++;
			}
		}
		for (int id : ids) {
			int lid = m - l[id];
			int rid = r[id] - m + 1;
			for (P p : ch[k[id]]) {
				if (ldp[lid][p.first] && rdp[rid][p.second]) {
					ans[id] = true; break;
				}
			}
		}
	};
	yaru(0, n);
	rep(i, q) {
		if (ans[i])cout << "Yes\n";
		else cout << "No\n";
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i,t)
	solve();
	return 0;
}