#include<bits/stdc++.h>
#define Start cin.tie(0), cout.tie(0), ios::sync_with_stdio(false)
#define PII pair<int,int> 
#define x first
#define y second
#define ull unsigned long long
#define ll long long
using namespace std;

struct edge
{
	int x,y,z;
	bool operator < (const edge &i)	const
	{
		return(x == i.x ? (y == i.y ? z < i.z : y < i.z) : x < i.x);
	}
};

const int M = 1000000007;
const int N = 1e5 + 10;

void func(void);

signed main(void)
{
	Start;
	int _ ; cin >> _;
	while(_--)	func();
	return 0;
}

void func(void)
{
	int n,m,x,y,ans = 0;
	cin >> n >> m >> x >> y;
	vector<PII> a(x);
	vector<PII> b(y);
	for(auto &i : a)	cin >> i.x >> i.y;
	for(auto &i : b)	cin >> i.x >> i.y;
	sort(a.begin(),a.end());
	sort(b.begin(),b.end());
	int i=0,j=0;
	while(i<x && j<y)
	{
		int res = 0;
		while(a[i].y < b[j].x)
		{
			++i;
			if(i >= x)	break;
		}
		while(a[i].x > b[j].y)
		{
			++j;
			if(j >= y)	break;
		}
		if(i >= x || j >= y)	break;
		if(a[i].y <= b[j].y)
		{
			if(a[i].x <= b[j].x)	res = a[i].y - b[j].x + 1;
			else res = a[i].y - a[i].x + 1;
			// cout << i << ' ' << j << ' ' << res << '\n';
			++i;
		}
		else if(a[i].y >= b[j].y)
		{
			if(a[i].x >= b[j].x)	res = (b[j].y - a[i].x + 1);
			else res = b[j].y - b[i].x + 1;
			// cout << i << ' ' << j << ' ' << res << '\n';
			++j;
		}
		if(i > x || j > y)	break;
		// cout << i << ' ' << j << ' ' << res << '\n';
		ans += (res >= m ? res-m+1 : 0);
	}
	cout << ans << '\n';
}