///https://www.instagram.com/_modwwe/
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void phongbeo();
const int mod2=1e9+7;
const int mod1=998244353;
struct icd
{
int a,b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c, d,e,f;
};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
// fin(task),fou(task);
#endif
NHP
/// cin>>s1;
// modwwe
phongbeo();
}
vector<int> v;
int c[500001];
int dp[2001][2001][2][2];
int d[500002][2];
void phongbeo()
{
cin>>n>>m;
for(int i=1; i<=n; i++)
{
cin>>l;
c[l]++;
v.pb(l);
}
v.pb(-1);
sort(v.begin(),v.end());
for(int i=0; i<=n; i++)
for(int j=n+1; j>i; --j)
for(int f2=0; f2<=1; f2++)
for(int f=0; f<=1; f++)
dp[i][j][f2][f]=1e9;
dp[0][n][1][1]=0;
dp[1][n+1][0][0]=0;
for(int i=0;i<=n;i++)
for(int j=n+1;j>i;--j)
for(int f2=0;f2<=1;f2++)
{
if(i+1<j)
dp[i+1][j][0][f2]=min((v[i+1]-v[i])*(n-j+1+i+1)+dp[i][j][0][f2],dp[i+1][j][0][f2]),
dp[i+1][j][0][f2]=min(dp[i+1][j][0][f2],dp[i][j][1][f2]+(v[j]-v[i+1])*(n-j+1+i+1));
if(j-1>i)
dp[i][j-1][1][f2]=min((v[j]-v[j-1])*((n-j+1+i+1))+dp[i][j][1][f2],dp[i][j-1][1][f2]),
dp[i][j-1][1][f2]=min(dp[i][j-1][1][f2],dp[i][j][0][f2]+(n-j+1+i+1)*(v[j-1]-v[i]));
}
for(int i=0;i<=m+1;i++)
for(int f=0;f<=1;++f)
d[i][f]=1e9;
for(int i=0;i<=n;i++)
for(int f=0;f<=1;++f)
for(int f2=0;f2<=1;++f2){
if(dp[i][i+1][f][f2]<=1e6){
d[v[i+f]][f2]=dp[i][i+1][f][f2];
}
}
for(int i=1;i<=m;i++)
for(int f=0;f<=1;++f)
d[i][f]=min(d[i-1][f]+n+1,d[i][f]);
for(int i=m;i>=0;--i)
for(int f=0;f<=1;++f)
d[i][f]=min(d[i+1][f]+n+1,d[i][f]);
cin>>m;
while(m--)
{
cin>>l>>r>>s2;
s5=min(d[r][0]+abs(v[1]-l),d[r][1]+abs(v[n]-l));
if(s5+n<=s2) cout<<"Yes",down
else cout<<"No",down
}
}
