#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;
  }

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

int gap;
Mast a,b,c;

bool overlap(pair<int,int> a,pair<int,int> b){
  if (a.first<b.first) swap(a,b);
  if (b.first+b.second<a.first) return false;
  int g=a.second+b.second-(a.first-b.first);
  return g>gap;
}

int64_t solve(int ai,int bi,int ci){
  if (ai==-1 or bi==-1 or ci==-1) return 0;

  static map<tuple<int,int,int>,int64_t> memo;
  auto const key=make_tuple(ai,bi,ci);
  if (memo.count(key)) return memo[key];
  auto &best=memo[key];

  int level=INT32_MAX;
  if (ai<a.n) level=min(level,a[ai]);
  if (bi<b.n) level=min(level,b[bi]);
  if (ci<c.n) level=min(level,c[ci]);

  for (int aj=0; aj<ai and (ai==a.n or a[aj]+a.w<=a[ai]); aj++){
    if ((aj>=0 and a[aj]<=level)
        and (bi==b.n or not overlap({a[aj],a.w},{b[bi],b.w}))){
      best=max(best,solve(aj,bi,ci)+a.area());
    }
  }
  for (int bj=0; bj<bi and (bi==b.n or b[bj]+b.w<=b[bi]); bj++){
    if ((bj>=0 and b[bj]<=level)
        and (ai==a.n or not overlap({b[bj],b.w},{a[ai],a.w}))
        and (ci==c.n or not overlap({b[bj],b.w},{c[ci],c.w}))){
      best=max(best,solve(ai,bj,ci)+b.area());
    }
  }
  for (int cj=0; cj<ci and (ci==c.n or c[cj]+c.w<=c[ci]); cj++){
    if ((cj>=0 and c[cj]<=level)
        and (bi==b.n or not overlap({c[cj],c.w},{b[bi],b.w}))){
      best=max(best,solve(ai,bi,cj)+c.area());
    }
  }
  return best;
}

int main(){
  cin>>gap;
  a.read();
  b.read();
  c.read();

  cout<<solve(a.n,b.n,c.n)<<endl;
}