#include <bits/stdc++.h>
using namespace std;
using ll =long long;
ll a[1000005];
ll pre[1000005];
ll sum[1000005];
int main()
{
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
ll n,q;
cin>>n>>q;
for(int i=1;i<=n;i++) {
cin >> a[i];
if(i!=1)
pre[i]=a[i]-a[i-1];
}
sort(pre+1,pre+1+n,greater<ll>());
for(int i=1;i<=n;i++) {
sum[i] = sum[i - 1] + pre[i];
}
ll x,y;
while(q--)
{
cin>>x>>y;
ll l= lower_bound(pre+1,pre+1+n,x,greater<ll>())-pre;
ll ans=sum[l-1]-(l-1)*x;
if(ans>=y)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
}