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

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

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

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

  int64_t area() const{
    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;

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(Mast const &a,Mast const &b){
  int64_t res=0;
  int64_t last_res=0;
  vector<int64_t> dp(b.n,0);

  vector<bool> allowed(b.n,true);
  for (int i=0; i<b.n; i++){
    for (int j=0; j<a.n; j++){
      if (overlap({a[j],a.w},{b[i],b.w})){
        allowed[i]=false;
      }
    }
  }

  for (int i=0,j=0; i<b.n; i++) if (allowed[i]){
    while (j<i and b[j]+b.w<=b[i]){
      last_res=max(last_res,dp[j]);
      ++j;
    }
    dp[i]=max(dp[i],last_res+b.area());
    res=max(res,dp[i]);
  }
  return res;
}

int main(){
  cin>>gap;

  Mast a,b,c;
  a.read();
  b.read();
  c.read();

  int64_t best=0;
  for (int64_t mask=(1llu<<(int64_t)b.n); mask--;){
    Mast m={0,b.w,{}};
    for (int64_t i=0; i<b.n; i++){
      if (mask&(1llu<<i)) m.y.push_back(b.y[i]), m.n++;
    }
    bool ok=true;
    for (int i=1; i<m.n; i++){
      ok&=(m.y[i-1]+m.w<=m.y[i]);
    }
    if (ok) best=max(best,m.area()*m.n+solve(m,a)+solve(m,c));
  }

  cout<<best<<endl;
}