0pts

#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[101000], b[101000], c[101000];

int main() {
	cin >> n >> m;
	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 + 1 + n);
	int v, s;
	for (int i = 1; i <= n; i++) {
		cin >> v >> s;
		int l = 1, r = n;
		bool f = 0;
		while (l <= r) {
			int m = (l + r) / 2;
			if (c[m] > s) {
				if (m == 1 || c[m - 1] <= s) {
					cout << "Yes" << endl;
					f = 1;
					break;
				} else {
					r = m - 1;
				}
			}
			if (c[m] <= s) {
				l = m + 1;
			}
		}
		if (f == 0) {
			cout << "No" << endl;
		}
	}
	return 0;
}