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

  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<int> ya,yb,yc;
  for (int i=0; i<b.n; i++){
    if (not yb.empty() and b[i]-yb.back()<b.w) continue;
    yb.push_back(b[i]);
  }
  for (int i=0; i<a.n; i++){
    if (not ya.empty() and a[i]-ya.back()<a.w) continue;
    bool ok=true;
    for (int j: yb) if (abs(j-a[i])<ab_off) ok=false;
    if (ok) ya.push_back(a[i]);
  }
  for (int i=0; i<c.n; i++){
    if (not yc.empty() and c[i]-yc.back()<c.w) continue;
    bool ok=true;
    for (int j: yb) if (abs(j-c[i])<bc_off) ok=false;
    if (ok) yc.push_back(c[i]);
  }
  cout<<a.area()*ya.size()+b.area()*yb.size()+c.area()*yc.size()<<endl;
}