#include #include using namespace std; const int MAXN = 100010; int n, m; int xx[MAXN], yy[MAXN], sumx[MAXN], sumy[MAXN]; int main() { int T; scanf("%d", &T); while (T--) { int k, q; scanf("%d%d%d%d", &n, &m, &k, &q); memset(xx, 0, sizeof(xx)); memset(yy, 0, sizeof(yy)); for (int i = 0; i < k; i++) { int u, v; scanf("%d%d", &u, &v); xx[u] = 1; yy[v] = 1; } sumx[0] = 0; sumy[0] = 0; for (int i = 1; i <= n; i++) sumx[i] = sumx[i-1] + xx[i]; for (int i = 1; i <= m; i++) sumy[i] = sumy[i-1] + yy[i]; for (int i = 0; i < q; i++) { int x1, y1, x2, y2; scanf("%d%d%d%d", &x1, &y1, &x2, &y2); if (sumx[x2] - sumx[x1-1] == x2 - x1 + 1 || sumy[y2] - sumy[y1-1] == y2 - y1 + 1) printf("Yes\n"); else printf("No\n"); } } return 0; }