#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,q,a[100005],b[100005],x,y;
int main(){
	cin>>n>>q;
	for(int i = 1;i<=n;i++){
		cin>>a[i];
	}
	for(int i = 1;i<=n;i++)cin>>b[i],b[i] = a[i]-b[i]-1;
	sort(b+1,b+1+n); 
	while(q--){
		cin>>y>>x;
		ll t = lower_bound(b+1,b+1+n,x)-b;
		if(t>=y)cout<<"YES\n";
		else cout<<"NO\n";
	}
	return 0;

}