#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int brute(int s, int g, vector<int> a) {
sort(begin(a), end(a));
int res = INT_MAX;
do {
int total = 0;
int pos = s, now = 1;
for (auto& u : a) {
total += abs(pos - u) * now;
total += 1;
now += 1;
pos = u;
}
//~ for (auto& u : a) {
//~ cout << u << " ";
//~ }
//~ cout << "bef = " << total << " -> ";
total += abs(pos - g) * now;
//~ cout << "got = " << total << "\n";
res = min(res, total);
} while (next_permutation(begin(a), end(a)));
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, l;
cin >> n >> l;
int left = l, right = 0;
vector<int> cnt(l + 1);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
cnt[x] += 1;
a[i] = x;
left = min(left, x);
right = max(right, x);
}
int q;
cin >> q;
while (q--) {
int s, g, t;
cin >> s >> g >> t;
int exp = brute(s, g, a);
int total = exp;
cout << (total <= t ? "Yes\n" : "No\n");
}
}
