#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************





void solve() {
    
    int w, h;
    cin>> w >> h;
	
	int ans = 0;
	int mn = INF;
	int mx = -INF;
	
	int x1;
    cin >> x1;
    
    for(int i=1; i<=x1; i++){
    	int x;
    	cin >> x;
    	mn = min(mn, x);
    	mx = max(mx, x);
    }
    ans = max(ans, (mx-mn)*h);   

	int x2;
    cin >> x2;
    mn = INF;
    mx = -INF;
    for(int i=1; i<=x2; i++){
    	int x;
    	cin >> x;
    	mn = min(mn, x);
    	mx = max(mx, x);
    }
    ans = max(ans, (mx-mn)*h);
 
  
	int y1;
    cin >> y1;
    mn = INF;
    mx = -INF;
    for(int i=1; i<=y1; i++){
    	int y;
    	cin >> y;
    	mn = min(mn, y);
    	mx = max(mx, y);
    }
    ans = max(ans, (mx-mn)*w);
    
	int y2;
    cin >> y2;
    mn = INF;
    mx = -INF;
    for(int i=1; i<=y2; i++){
    	int y;
    	cin >> y;
    	mn = min(mn, y);
    	mx = max(mx, y);
    }
    ans = max(ans, (mx-mn)*w);
 
	cout << ans << endl;

}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}