#include <cstdio>
using namespace std;

const int maxn = 100005;

int x[maxn], y[maxn];

int main() {
    int n, m, k, q, T;
    scanf("%d", &T);
    while(T--) {
        scanf("%d%d%d%d", &n, &m, &k, &q);
        int u, v;
        for(int i = 1; i <= n; i++) x[i] = 0;
        for(int i = 1; i <= m; i++) y[i] = 0;
        for(int i = 0; i < k; i++) {
            scanf("%d%d", &u, &v);
            x[u] = 1;
            y[v] = 1;
        }
        for(int i = 1; i <= n; i++) x[i] += x[i - 1];
        for(int i = 1; i <= m; i++) y[i] += y[i - 1];
        int x1, x2, y1, y2;
        for(int i = 0; i < q; i++) {
            scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
            printf("%s\n", ((x[x2] - x[x1 - 1] == (x2 - x1 + 1)) || y[y2] - y[y1 - 1] == (y2 - y1 + 1)) ? "Yes" : "No");
        }
    }
    return 0;
}