#include<vector>
#include<iostream>
#include<algorithm>

#define int long long 
#define endl "\n"

using namespace std;
const int maxn = (int) 1e6 + 10;  

void solve() {
    int n, m, x, y;
    cin >> n >> m >> x >> y;
    
    vector<pair<int, int>> a(x), b(y);
    int u, v;
    for(int i = 0; i < x; i++) {
        cin >> u >> v;
        a[i] = make_pair(u, v);
    }
    for(int i = 0; i < y; i++) {
        cin >> u >> v;
        b[i] = make_pair(u, v);
    }

    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    int i = 0;
    for(int j = 1; j < x; j++) {
        if(a[j].first - a[i].second <= 1) {
            a[i].second = a[j].second;
        }else {
            a[++i] = a[j];
        }
    }
    a.resize(i + 1);

    i = 0;
    for(int j = 1; j < y; j++) {
        if(b[j].first - b[i].second <= 1){
            b[i].second = b[j].second;
        }else {
            b[++i] = b[j];
        }
    }
    b.resize(i + 1);

    int ans = 0;
    i = 0;
    int j = 0;
    while(i < a.size() && j < b.size()) {
        pair<int, int> aa, bb;
        aa = a[i]; bb = b[j];

        if(aa.second <= bb.first) {
            i++;
            continue;
        }

        if(aa.first >= bb.second) {
            j++;
            continue;
        }

        if(aa.first <= bb.first && aa.second >= bb.second) {
            ans += bb.second - bb.first + 1 - m + 1;
        }else if(aa.first >= bb.first && aa.second <= bb.second) {
            ans += aa.second - aa.first + 1 - m + 1;
        }else if(aa.first <= bb.first && aa.second <= bb.second){
            ans += aa.second - bb.first + 1 - m + 1;
        }else if(aa.first >= bb.first && aa.second >= bb.second) {
            ans += bb.second - aa.first + 1 - m + 1;
        }

        if(aa.second < bb.second) {
            i ++;
        }else{
            j ++;
        }
    }
    
    cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    int tc;
    cin >> tc;
    while(tc--) solve();
}