#include <bits/stdc++.h>
using namespace std;
#define task "main"
#define no "NO"
#define yes "YES"
#define F first
#define S second
#define vec vector
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
const int MAX_N = (int)5e5 + 5;
int n, l, q;
int a[MAX_N];
namespace sub3 {
bool valid() {
return n <= 14 && q <= 10;
}
long long dp[(1 << 14) + 5][20];
void solve() {
while (q--) {
int s, t, limit;
cin >> s >> t >> limit;
memset(dp, 0x3f, sizeof(dp));
FOR(i, 1, n) dp[1 << (i - 1)][i] = abs(s - a[i]) + 1;
FOR(mask, 1, (1 << n) - 1) FOR(last, 1, n) if ((mask >> (last - 1) & 1) && dp[mask][last] <= limit) FOR(nxt, 1, n)
if (!(mask >> (nxt - 1) & 1))
minimize(dp[mask | (1 << (nxt - 1))][nxt], dp[mask][last] + 1LL * abs(a[last] - a[nxt]) * (__builtin_popcount(mask) + 1) + 1);
bool ok = false;
FOR(i, 1, n) if (dp[(1 << n) - 1][i] + 1LL * abs(a[i] - t) * (n + 1) <= limit) {
ok = true;
break;
}
cout << (ok ? "Yes\n" : "No\n");
}
}
}
void solve() {
cin >> n >> l;
FOR(i, 1, n) cin >> a[i];
cin >> q;
if (sub3::valid()) sub3::solve();
}
int32_t main() {
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
bool multitest = 0;
int numTest = 1;
if (multitest) cin >> numTest;
while (numTest--) {
solve();
}
return 0;
}
/* Lak lu theo dieu nhac!!!! */
