#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N =100005;
int cnt[2][N];

void solve()
{
    int n, m, K, Q;
    scanf("%d%d%d%d", &n, &m, &K, &Q);
    memset(cnt, 0, sizeof(cnt));
    for (int i=0; i<K; ++i) {
        int x, y;
        scanf("%d%d", &x, &y);
        cnt[0][x] = cnt[1][y] = 1;
    }
    for (int i=1; i<=n; ++i) {
        cnt[0][i] += cnt[0][i-1];
        cnt[1][i] += cnt[1][i-1];
    }
    for (int i=0; i<Q; ++i) {
        int x1, y1, x2, y2;
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        --x1, --y1;
        if (cnt[0][x2]-cnt[0][x1]==x2-x1 || cnt[1][y2]-cnt[1][y1]==y2-y1) {
            printf("Yes\n");
        } else {
            printf("No\n");
        }
    }
}

int main()
{
    int n;
    scanf("%d", &n);
    for (int i=0; i<n; ++i) {
        solve();
    }
    return 0;
}