#include<iostream>
#include<algorithm>
using namespace std;
long long dp[205][205][205];
int a[205], b[205], c[205];
bool cmp(int x, int y){return x > y;}
int main(){
int first, second, third;
cin >> first >> second >> third;
int i =1;while(i <= first)cin >> a[i++];
i =1;while(second >= i)cin >> b[i++];
i =1;while(third >= i)cin >> c[i++];sort(a +1, a + first +1, cmp);sort(b +1, b + second +1, cmp);sort(c +1, c + third +1, cmp);
long long ans =0;for(int i =0; i <= first; i++){for(int j =0; j <= second; j++){for(int k =0; k <= third; k++){
dp[i +1][j +1][k]=max(dp[i +1][j +1][k], dp[i][j][k]+ a[i +1]* b[j +1]);
dp[i +1][j][k +1]=max(dp[i +1][j][k +1], dp[i][j][k]+ a[i +1]* c[k +1]);
dp[i][j +1][k +1]=max(dp[i][j +1][k +1], dp[i][j][k]+ b[j +1]* c[k +1]);
ans =max(ans,max(dp[i +1][j +1][k],max(dp[i +1][j][k +1], dp[i][j +1][k +1])));}}}
cout << ans << endl;}