#include<bits/stdc++.h>
using namespace std; 
int n,q, c[200005],b[200005], a[200005];
int cmp(int a,int b){
return a>b;
}
int main(){
	freopen("Max.in","r",stdin);
	freopen("Max.out","w",stdout);
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n;i++){
		cin>>b[i];
		c[i]=a[i]-b[i];
	}
	sort(c+1,c+n+1,cmp);
	while(q--){
		int x,y;
		cin>>x>>y;
		if(y<c[x])
		cout<<"YES"<<endl;
		else
		cout<<"NO"<<endl;
	}
	return 0;
}