#include <bits/stdc++.h>
 
using namespace std;
 
 
 
 
 
int main() {
 
    ios_base::sync_with_stdio(false);
 
    cin.tie(NULL);
 
    int N, Q;
 
    cin >> N >> Q;
 
 
 
    vector<int> timeleft(N);
 
    int tmp=0;
 
    for (int i = 0; i < N; ++i) cin >> timeleft[i]; //input close time
 
    for (int i = 0; i < N; ++i) {
 
        cin >> tmp; // t, traveling time to get to farm
 
        timeleft[i] -= tmp; //closetime-t, s+t<c, so s<c-t, only keep how many time left to close time
 
    }
    sort(timeleft.begin(), timeleft.end());
    while(Q--){
    	int v,s;cin>>v>>s;
    	auto it = upper_bound(timeleft.begin(),timeleft.end(), s);
    	int idx=distance(timeleft.begin(), it);
    	(timeleft.size()-idx>=v) ? cout<<"YES"<<endl : cout<<"NO"<<endl;
    }
 
}
 
 
 
 
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKIAoKIAoKaW50IG1haW4oKSB7CgogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CgogICAgY2luLnRpZShOVUxMKTsKCiAgICBpbnQgTiwgUTsKCiAgICBjaW4gPj4gTiA+PiBROwoKIAoKICAgIHZlY3RvcjxpbnQ+IHRpbWVsZWZ0KE4pOwoKICAgIGludCB0bXA9MDsKCiAgICBmb3IgKGludCBpID0gMDsgaSA8IE47ICsraSkgY2luID4+IHRpbWVsZWZ0W2ldOyAvL2lucHV0IGNsb3NlIHRpbWUKCiAgICBmb3IgKGludCBpID0gMDsgaSA8IE47ICsraSkgewoKICAgICAgICBjaW4gPj4gdG1wOyAvLyB0LCB0cmF2ZWxpbmcgdGltZSB0byBnZXQgdG8gZmFybQoKICAgICAgICB0aW1lbGVmdFtpXSAtPSB0bXA7IC8vY2xvc2V0aW1lLXQsIHMrdDxjLCBzbyBzPGMtdCwgb25seSBrZWVwIGhvdyBtYW55IHRpbWUgbGVmdCB0byBjbG9zZSB0aW1lCgogICAgfQogICAgc29ydCh0aW1lbGVmdC5iZWdpbigpLCB0aW1lbGVmdC5lbmQoKSk7CiAgICB3aGlsZShRLS0pewogICAgCWludCB2LHM7Y2luPj52Pj5zOwogICAgCWF1dG8gaXQgPSB1cHBlcl9ib3VuZCh0aW1lbGVmdC5iZWdpbigpLHRpbWVsZWZ0LmVuZCgpLCBzKTsKICAgIAlpbnQgaWR4PWRpc3RhbmNlKHRpbWVsZWZ0LmJlZ2luKCksIGl0KTsKICAgIAkodGltZWxlZnQuc2l6ZSgpLWlkeD49dikgPyBjb3V0PDwiWUVTIjw8ZW5kbCA6IGNvdXQ8PCJOTyI8PGVuZGw7CiAgICB9Cgp9CgoKCgo=

NSA1CjMgNSA3IDkgMTIKNCAyIDMgMyA4CjEgNQoxIDYKMyAzCjQgMgo1IDE=

5 5
3 5 7 9 12
4 2 3 3 8
1 5
1 6
3 3
4 2
5 1