#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

const int MAX = 100005;
int fir[MAX];
int sec[MAX];

int fc[MAX];
int sc[MAX];

int main() {
    int tc; scanf("%d", &tc);
    for (int tcs=0; tcs<tc; tcs++) {
        for (int i=0; i<MAX; i++) { fc[i] = 0; sc[i] = 0; fir[i] = 0; sec[i] = 0; }
        int n, m, q, k;
        scanf("%d %d %d %d", &n, &m, &q, &k);
        int x, y;
        for (int i=0; i<q; i++) {
            scanf("%d %d", &x, &y);
            fir[x] = 1; sec[y] = 1;
        }
        fc[0] = fir[0]; sc[0] = sec[0];
        for (int i=1; i <MAX; i++) {
            fc[i] = fc[i-1] + fir[i];
            sc[i] = sc[i-1] + sec[i];
        }

        int a1, a2, a3, a4;
        for (int i=0; i<k; i++) {
            scanf("%d %d %d %d", &a1, &a2, &a3, &a4);
            if (fc[a3] - fc[a1-1] == a3 - a1 + 1 || sc[a4] - sc[a2-1] == a4 - a2 + 1) { cout << "Yes" << endl; }
            else { cout << "No" << endl; }
        }
    }
}