#include <bits/stdc++.h>
using namespace std;

struct Mast{
  int n;
  int w;
  vector<int> y;

  int &operator[](int i){
    return y[i];
  }

  int64_t area(){
    return w*(int64_t)w;
  }

  Mast(){
    cin>>n>>w;
    y.resize(n);
    for (auto &i: y){
      cin>>i;
    }
    sort(y.begin(),y.end());
  }
};

int main(){
  int gap; cin>>gap;
  Mast a,b,c; assert(a.w<=gap and b.w<=gap and c.w<=gap);

  b.y.emplace_back(max(max(
      a.w+a[a.n-1],
      b.w+b[b.n-1]),
      c.w+c[c.n-1]));
  b.n++;

  int ab_off=(max(0,(a.w+b.w)-gap) + 1)/2;
  int bc_off=(max(0,(b.w+c.w)-gap) + 1)/2;

  vector<int64_t> dp(b.n+1);
  for (int i=0; i<b.n; i++){
    int64_t score=b.area();

    int ai=a.n-1,ay=b[i]-ab_off;
    int ci=c.n-1,cy=b[i]-bc_off;

    for (int j=i; j>=0; j--){
      if (j==0 or b[j-1]+b.w<=b[i]){

        while (ai>=0){
          if (a[ai]>ay) {
            --ai;
          }else if (j==0 or (a[ai]>=b[j-1]+ab_off and a[ai]>b[j-1])){
            score+=a.area();
            ay=a[ai]-a.w;
            --ai;
          }else{
            break;
          }
        }
 
        while (ci>=0){
          if (c[ci]>cy){
            --ci;
          }else if (j==0 or (c[ci]>=b[j-1]+bc_off and c[ci]>b[j-1])){
            score+=c.area();
            cy=c[ci]-c.w;
            --ci;
          }else{
            break;
          }
        }

        dp[i+1]=max(dp[i+1],dp[j]+score);
      }
    }
//    cerr<<"dp "<<i+1<<" = "<<dp[i+1]
//        <<" (safe="<<b[i]-ab_off<<" "<<b[i]-bc_off<<")"<<endl;
  }

  cout<<dp.back()-b.area()<<endl;
}