#include<iostream>
#include<cassert>
using namespace std;
const int off=3000;
int A[2*off+1],Acnt[2*off+1],Asum[2*off+1];
int B[2*off+1],Bcnt[2*off+1],Bsum[2*off+1];
int C[2*off+1],Ccnt[2*off+1],Csum[2*off+1];
void rd(int N,int A[],int Acnt[],int Asum[])
{
	for(int i=0;i<N;i++)
	{
		int a;cin>>a;
		A[a+off]++;
		Acnt[a+off]++;
		Asum[a+off]+=a;
	}
	for(int i=2*off-1;i>=0;i--)
	{
		Acnt[i]+=Acnt[i+1];
		Asum[i]+=Asum[i+1];
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int NA,NB,NC;
	cin>>NA>>NB>>NC;
	rd(NA,A,Acnt,Asum);
	rd(NB,B,Bcnt,Bsum);
	rd(NC,C,Ccnt,Csum);
	long long ans=0;
	for(int la=-off;la<=off;la++)for(int lb=-off;lb<=off;lb++)
	{
		long long now=(long long)Asum[la+off]*Bcnt[lb+off];
		long long x=Acnt[la+off],y=Bsum[lb+off];
		//C->C*Acnt[la+off]+Bsum[lb+off]>=0
		//C->C*x+y>=0
		//C>=-y/x
		int lc=x==0?y==0?off:-off:-y>=0?(-y+x-1)/x:-y/x;
		lc=max(min(lc,off),-off);
		now+=Csum[lc+off]*x+Ccnt[lc+off]*y;
		ans=max(ans,now);
	}
	cout<<ans<<endl;
}