for(int i = 1; i <= 4; i ++) {

	cin >> a[i];
}
int time = 0;

for(int i = 1; i <= 4; i ++) {

	memset(b, 0, sizeof(b))；

	int maxn = 0;

	for(int j = 1; j <= a[i]; j ++) {

		cin >> work;
  
		b[w] = work;
  
		if(work >= maxn) maxn = work;
  
		w ++;
  
	}

	if(w == 1) {

		time += maxn;
  
		continue;
	}
	sort(b + 1, b + w + 1);

	time += max(b[w], b[w - 1]);

	for(int x = b[w - 2]; x >= b[1]; x -= 2) {

		time += max(b[x], b[x - 1]);
	}

}

cout << time;

}