description: A rectangle with its opposite corners in (0, 0) and (w, h) and sides parallel to the axes is drawn on a plane.
  
  You are given a list of lattice points such that each point lies on a side of a rectangle but not in its corner. Also, there are at least two points on every side of a rectangle.
  
  Your task is to choose three points in such a way that: 
  
    * exactly two of them belong to the same side of a rectangle; 
    * the area of a triangle formed by them is maximum possible. 
  
  
  
  Print the doubled area of this triangle. It can be shown that the doubled area of any triangle formed by lattice points is always an integer.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
  
  The first line of each testcase contains two integers w and h (3 ≤ w, h ≤ 10^6) — the coordinates of the corner of a rectangle.
  
  The next two lines contain the description of the points on two horizontal sides. First, an integer k (2 ≤ k ≤ 2 ⋅ 10^5) — the number of points. Then, k integers x_1 < x_2 < ... < x_k (0 < x_i < w) — the x coordinates of the points in the ascending order. The y coordinate for the first line is 0 and for the second line is h.
  
  The next two lines contain the description of the points on two vertical sides. First, an integer k (2 ≤ k ≤ 2 ⋅ 10^5) — the number of points. Then, k integers y_1 < y_2 < ... < y_k (0 < y_i < h) — the y coordinates of the points in the ascending order. The x coordinate for the first line is 0 and for the second line is w.
  
  The total number of points on all sides in all testcases doesn't exceed 2 ⋅ 10^5.
  
  Output
  
  For each testcase print a single integer — the doubled maximum area of a triangle formed by such three points that exactly two of them belong to the same side.
  
  Example
  
  Input
  
  
  3
  5 8
  2 1 2
  3 2 3 4
  3 1 4 6
  2 4 5
  10 7
  2 3 9
  2 1 7
  3 1 3 4
  3 4 5 6
  11 5
  3 1 6 8
  3 3 6 8
  3 1 3 4
  2 2 4
  
  
  Output
  
  
  25
  42
  35
  
  Note
  
  The points in the first testcase of the example: 
  
    * (1, 0), (2, 0); 
    * (2, 8), (3, 8), (4, 8); 
    * (0, 1), (0, 4), (0, 6); 
    * (5, 4), (5, 5). 
  
  
  
  The largest triangle is formed by points (0, 1), (0, 6) and (5, 4) — its area is 25/2. Thus, the doubled area is 25. Two points that are on the same side are: (0, 1) and (0, 6).
solution: import java.util.*;
  import java.io.*;
  import java.lang.*;
  
  // Problem - Multiples of 3 onn codeforces MNedium difficulty level 
  // or check on youtube channel CodeNCode
  
  public class Problem {
       static int Mod = 1000000007;
      static long dp[][];
      static int g[][];
      static int fact[];
  
  
      public static void main(String[] args) {
          MyScanner scan = new MyScanner();
          PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
           int t = scan.nextInt();
          // int t = 1;
          while (t-- > 0) {
                long w= scan.nextLong();
                long h= scan.nextLong();
                int k1= scan.nextInt();
                long a1[]= new long[k1];
                for(int i=0;i<k1;i++)
                a1[i]= scan.nextLong();
                long ans= Long.MIN_VALUE;
                ans= Math.max(ans, (a1[k1-1]-a1[0])*h);
  
                int k2= scan.nextInt();
                long a2[]= new long[k2];
                for(int i=0;i<k2;i++)
                a2[i]= scan.nextLong();
               
                ans= Math.max(ans, (a2[k2-1]-a2[0])*h);
  
                int k3= scan.nextInt();
                long a3[]= new long[k3];
                for(int i=0;i<k3;i++)
                a3[i]= scan.nextLong();
               
                ans= Math.max(ans, (a3[k3-1]-a3[0])*w);
  
                int k4= scan.nextInt();
                long a4[]= new long[k4];
                for(int i=0;i<k4;i++)
                a4[i]= scan.nextLong();
               
                ans= Math.max(ans, (a4[k4-1]-a4[0])*w);
  
                out.println(ans);
  
  
  
                
                
          }
  
          out.close();
      }
  
   
  
  
  
      static ArrayList<Integer> digits(int n){
          ArrayList<Integer> list= new ArrayList<>();
          while(n>0){
              list.add(n%10);
              n=n/10;
          }
          Collections.reverse(list);
          return list;
      }
  
      static class Pair {
          int l;
          int r;
  
          Pair(int l, int r) {
              this.l = l;
              this.r = r;
          }
  
          @Override
          public int hashCode() {
              final int prime = 31;
              int result = 1;
              result = prime * result + l;
              result = prime * result + r;
              return result;
          }
  
          @Override
          public boolean equals(Object obj) {
              if (this == obj)
                  return true;
              if (obj == null)
                  return false;
              if (getClass() != obj.getClass())
                  return false;
              Pair other = (Pair) obj;
              if (l != other.l)
                  return false;
              if (r != other.r)
                  return false;
              return true;
          }
  
          @Override
          public String toString() {
              return "Pair [l=" + l + ", r=" + r + "]";
          }
  
      }
  
      public static void reverse(int a[]) {
          int n = a.length;
          for (int i = 0; i < n / 2; i++) {
              int temp = a[i];
              a[i] = a[n - i - 1];
              a[n - i - 1] = temp;
          }
      }
  
      public static void sort(int[] array) {
          ArrayList<Integer> copy = new ArrayList<>();
          for (Integer i : array)
              copy.add(i);
          Collections.sort(copy);
          for (int i = 0; i < array.length; i++)
              array[i] = copy.get(i);
      }
  
      public static void sort(long[] array) {
          ArrayList<Long> copy = new ArrayList<>();
          for (Long i : array)
              copy.add(i);
          Collections.sort(copy);
          for (int i = 0; i < array.length; i++)
              array[i] = copy.get(i);
      }
  
      public static long gcd(long a, long b) {
          if (b == 0)
              return a;
          return gcd(b, a % b); // gcd(a,b) = gcd(a-b,b) or gcd(a,b) = gcd(b,a%b) where a>b
      }
  
      public static int gcd(int a, int b) {
          if (b == 0)
              return a;
          return gcd(b, a % b); // gcd(a,b) = gcd(a-b,b) or gcd(a,b) = gcd(b,a%b) where a>b
      }
  
      public static long lcm(long a, long b) {
          return (a / gcd(a, b)) * b;
      }
  
      static long power(long x, long y) {
          long temp;
          if (y == 0) // a^b= (a^b/2)^2 if b is even
              return 1; // = (a*a^(b-1)) if b is odd
          temp = power(x, y / 2);
          if (y % 2 == 0)
              return temp * temp;
          else
              return x * temp * temp;
      }
  
      static long mod(long x) {
          return ((x % Mod + Mod) % Mod);
      }
  
      static long add(long a, long b) {
          return mod(mod(a) + mod(b));
      }
  
      static int mod(int x) {
          return ((x % Mod + Mod) % Mod);
      }
  
      static int add(int a, int b) {
          return mod(mod(a) + mod(b));
      }
  
      static int sub(int a, int b) {
          return mod(mod(a) - mod(b) + Mod);
      }
  
      static long mul(long a, long b) {
          return mod(mod(a) * mod(b));
      }
  
      static long pow(long x, long y, long p) {
          long res = 1; // Initialize result
          x = x % p; // Update x if it is more than or equal to p
  
          if (x == 0)
              return 0; // In case x is divisible by p;
  
          while (y > 0) {
              // If y is odd, multiply x with result
              if ((y & 1) != 0)
                  res = (res * x) % p;
  
              // y must be even now
              y = y >> 1; // y = y/2
              x = (x * x) % p;
          }
          return res;
      }
  
      static long modInverse(long a, long m) {
          // int g = gcd(a, m);
          // if (g != 1)
          // System.out.println("Inverse doesn't exist");
          // else {
          // // If a and m are relatively prime, then modulo
          // // inverse is a^(m-2) mode m
          // return power(a, m - 2, m);
          // }
          return pow(a, m - 2, m);
      }
  
  }
  
  class MyScanner {
      BufferedReader br;
      StringTokenizer st;
  
      public MyScanner() {
          br = new BufferedReader(new InputStreamReader(System.in));
      }
  
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
  
      int nextInt() {
          return Integer.parseInt(next());
      }
  
      long nextLong() {
          return Long.parseLong(next());
      }
  
      double nextDouble() {
          return Double.parseDouble(next());
      }
  
      String nextLine() {
          String str = "";
          try {
              str = br.readLine();
          } catch (IOException e) {
              e.printStackTrace();
          }
          return str;
      }
  
  }
  