#include <bits/stdc++.h> using namespace std; #define int long long #define pi pair<int, int> #define vi vector<int> #define vs vector<string> #define vb vector<bool> #define vpi vector<pi> #define pb push_back #define all(a) (a).begin(), (a).end() const int mod = 1e9 + 7; void solve() { int n, l; cin >> n >> l; vi x(n); for (int i = 0; i < n; i++) cin >> x[i]; sort(all(x)); int q; cin >> q; while (q--) { int s, e, t; cin >> s >> e >> t; // go rightmost -> leftmost int curr1 = abs(s - x[x.size() - 1]); int b1 = 0; for (int i = x.size() - 1; i > 0; i--) { b1++; curr1++; curr1 += (b1 + 1) * (x[i] - x[i - 1]); } b1++; curr1++; curr1 += (b1 + 1) * abs(x[0] - e); // go lefmost -> rightmost int curr2 = abs(s - x[0]); int b2 = 0; for (int i = 0; i < x.size() - 1; i++) { b2++; curr2++; curr2 += (b2 + 1) * (x[i + 1] - x[i]); } b2++; curr2++; curr2 += (b2 + 1) * abs(x[x.size() - 1] - e); cout << (min(curr1, curr2) <= t ? "Yes\n" : "No\n"); } } signed main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t = 1; // cin >> t; while (t--) { solve(); } return 0; }