#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N[3]; ll A[3][3030]; ll S[3][3030]; template struct ConvexHull { deque> Q; V calc(pair p, V x) { return p.first*x+p.second; } int dodo(pair A,pair B, pair C) { return ((__int128)(B.second-C.second)*(B.first-A.first)<=(__int128)(A.second-B.second)*(C.first-B.first)); } void add(V a, V b) { // add ax+b if(Q.size() && Q.back().first==a) { //aが同じ場合 //if(b>=Q.back().second) return; //minの場合 if(b<=Q.back().second) return; //maxの場合 Q.pop_back(); } Q.push_back({a,b}); int v; while((v=Q.size())>=3 && dodo(Q[v-3],Q[v-2],Q[v-1])) Q[v-2]=Q[v-1], Q.pop_back(); } void add(vector> v) { sort(v.begin(),v.end()); for(auto r=v.begin();r!=v.end();r++) add(r->first,r->second); } V query(V x) { int L=-1,R=Q.size()-1; while(R-L>1) { int M=(L+R)/2; (0^((calc(Q[M],x)<=calc(Q[M+1],x)))?L:R)=M; } return calc(Q[R],x); } }; void solve() { int i,j,k,l,r,x,y; string s; FOR(i,3) cin>>N[i]; FOR(i,3) { FOR(j,N[i]) cin>>A[i][j]; sort(A[i],A[i]+N[i]); reverse(A[i],A[i]+N[i]); FOR(j,N[i]) S[i][j+1]=S[i][j]+A[i][j]; } ll ma=0; FOR(i,N[0]+1) { vector> X; FOR(j,N[1]+1) { X.push_back({S[1][j],j*S[0][i]}); } ConvexHull ch; ch.add(X); FOR(j,N[2]+1) { ma=max(ma,ch.query(j)+i*S[2][j]); } } cout<