#ifdef LOCAL
#include "algo/debug.h"
#else
template <typename... Args>
void dummy(Args&&... args){}
#define ps dummy
#endif
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int inf=1e18;
#define fi first
#define se second
template<class T> using V = vector<T>;
using vi = V<int>;
using vb = V<bool>;
using vs = V<string>;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define len(x) (int)((x).size())
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define ai2 array<int,2>
#define ai3 array<int,3>
#define ai4 array<int,4>
#define ai5 array<int,5>
template<class T> int lwb(const V<T>& a, const T& b) { return lb(all(a),b)-begin(a); }
template<class T> int upb(const V<T>& a, const T& b) { return ub(all(a),b)-begin(a); }
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a=b, true : false; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a=b, true : false; }
#define pct __builtin_popcountll
#define ctz __builtin_ctzll
#define clz __builtin_clzll
constexpr int p2(int x) { return (int)1 << x; }
constexpr int msk2(int x) { return p2(x) - 1; }
constexpr int bits(int x) { return x == 0 ? 0 : 63-clz(x); } // floor(log2(x))
template<class T>void UNIQUE(V<T>& v) { sort(all(v)); v.erase(unique(all(v)),end(v)); }
template<class T, class Cmp>void UNIQUE(V<T>& v, Cmp cmp) { sort(all(v), cmp); v.erase(unique(all(v)),end(v)); }
template<class T,class U>void erase(T& t, const U& u) { auto it = t.find(u); assert(it != end(t)); t.erase(it); }
template<class F> struct y_combinator_result {
F f;
template<class T> explicit y_combinator_result(T &&f): f(std::forward<T>(f)) {}
template<class ...Args> decltype(auto) operator()(Args &&...args) { return f(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) yy(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
void solve() {
int n, max_x;
cin >> n >> max_x;
vi xx(n);
for (auto& x : xx)
cin >> x;
sort(all(xx));
vi pre(n + 1), suf(n + 1);
partial_sum(all(xx), begin(pre) + 1);
for (int i = n - 1; i >= 0; i--)
suf[i] = suf[i + 1] + xx[i];
int q;
cin >> q;
while (q--) {
int s, g, t_thres;
cin >> s >> g >> t_thres;
auto l = min({ s, g, xx[0] });
auto r = max({ s, g, xx.bk });
int ans = inf;
auto cnt_l = upb(xx, g);
auto cnt_r = n - cnt_l;
{
ckmin(ans,
s - l + r - l + r - g
+ cnt_l * (2 * r - g) - pre[cnt_l]
- g * cnt_r + suf[cnt_l]);
}
// ps("ans", ans);
{
ckmin(ans,
r - s + r - l + g - l
+ (g - 2 * l) * cnt_r + suf[cnt_l]
+ g * cnt_l - pre[cnt_l]);
}
// ps("ans", ans);
ans += n;
ps(ans);
cout << (ans <= t_thres ? "Yes" : "No") << '\n';
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
solve();
return 0;
}
