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

#define MAXN 100
#define MAXA (MAXN+1)

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

  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());

    p.resize(n+1);
    p[0]=-1;
    p[n]=n-1;
    for (int i=1; i<n; i++){
      p[i]=p[i-1];
      while (p[i]+1<i and y[p[i]+1]+w<=y[i]) ++p[i];
    }
  }
};

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 dp[MAXA][MAXA][MAXA];
int64_t dp1[MAXA][MAXA][MAXA];
int64_t dp2[MAXA][MAXA][MAXA];
int64_t dp3[MAXA][MAXA][MAXA];

void solve(int ai,int bi,int ci){
  auto &best=dp[ai][bi][ci];

  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]);

  int maj=-1,mbj=-1,mcj=-1;
  for (int rad=64; rad; rad/=2){
    if (maj+rad<a.n and a[maj+rad]<=(ai==a.n? level: min(level,a[ai]-a.w))
        and not overlap({a[maj+rad],a.w},{b[bi],b.w}))
      maj+=rad;
    if (mbj+rad<b.n and b[mbj+rad]<=(bi==b.n? level: min(level,b[bi]-b.w))
        and not overlap({b[mbj+rad],b.w},{a[ai],a.w})
        and not overlap({b[mbj+rad],b.w},{c[ci],c.w}))
      mbj+=rad;
    if (mcj+rad<c.n and c[mcj+rad]<=(ci==c.n? level: min(level,c[ci]-c.w))
        and not overlap({c[mcj+rad],c.w},{b[bi],b.w}))
      mcj+=rad;
  }

  if (maj>=0) best=max(best,dp1[maj][bi][ci]+a.area());
  if (mbj>=0) best=max(best,dp2[ai][mbj][ci]+b.area());
  if (mcj>=0) best=max(best,dp3[ai][bi][mcj]+c.area());

  dp1[ai][bi][ci]=max(ai? dp1[ai-1][bi][ci]: 0, best);
  dp2[ai][bi][ci]=max(bi? dp2[ai][bi-1][ci]: 0, best);
  dp3[ai][bi][ci]=max(ci? dp3[ai][bi][ci-1]: 0, best);
}

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

  for (int i=0; i<=a.n; i++){
    for (int j=0; j<=b.n; j++){
      for (int k=0; k<=c.n; k++){
        solve(i,j,k);
      }
    }
  }
  cout<<dp[a.n][b.n][c.n]<<endl;
}