#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
const int N=5e5+5;
int n,L,x[N],q;
ll sum[N];
struct Query{
	int s,t,lim,ans;
}qry[N];
ll sdist(int l,int r,int k){
	if(x[r]<=k){
		return 1LL*k*(r-l+1)-(sum[r]-sum[l-1]);
	}else if(x[l]>=k){
		return sum[r]-sum[l-1]-1LL*k*(r-l+1);
	}
	assert(0);
}
void solve(vector<int> qs){
	sort(x+1,x+n+1);
	For(i,1,n){
		sum[i]=sum[i-1]+x[i];
	}
	for(int id:qs){
		auto& [s,t,lim,ans]=qry[id];
		int l=lower_bound(x+1,x+n+1,s)-x,r=upper_bound(x+1,x+n+1,t)-x-1;
		int lm=(l>1?x[1]:s),rm=(r<n?x[n]:t);
		lim-=n+sdist(1,r,t)+sdist(r+1,n,t);
		if(1LL*(n-r)*(t-lm)*2+(rm-s+rm-lm+t-lm)<=lim){
			ans=1;
			continue;
		}
		auto calc=[&](int i){
			int p2=(i<r-l+1?x[l+i]:t);
			ll cur=1LL*(l-1+i)*(rm-p2)*2+1LL*(n-r)*(t-p2)*2;
			cur+=(s-lm)+(rm-lm)+(rm-p2)+(t-p2);
			return cur;
		};
		For(i,0,r-l+1){
			if(calc(i)<=lim){
				ans=1;
				break;
			}
		}
	}
}
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>L;
	For(i,1,n){
		cin>>x[i];
	}
	cin>>q;
	vector<int> qsl,qsr;
	For(i,1,q){
		cin>>qry[i].s>>qry[i].t>>qry[i].lim;
		if(qry[i].s<=qry[i].t){
			qsl.push_back(i);
		}else{
			qsr.push_back(i);
		}
	}
	solve(qsl);
	For(i,1,n){
		x[i]=L-x[i];
	}
	for(int i:qsr){
		qry[i].s=L-qry[i].s;
		qry[i].t=L-qry[i].t;
	}
	solve(qsr);
	For(i,1,q){
		cout<<(qry[i].ans?"Yes":"No")<<'\n';
	}
	return 0;
}