func_code_string: #include <bits/stdc++.h>   using namespace std;   #define ll long long int   #define mp make_pair   //ll const MAX_N=100000;   ll const MAX_A = (ll)1e9 + 1;   const ll MOD = 1e9 + 7;               void solve()   {    ll n, l,u,v,w,n1,n2,n3,h,sum=0,suma=0,sumb=0,sumc=0,minia=MAX_A,minib=MAX_A,minic=MAX_A, ansa,ansb,ansc;    cin>>n1>>n2>>n3;    ll a[n1],b[n2],c[n3];    vector<ll> pos;    for(auto & i: a)    {     cin>>i;     minia=min(i,minia);     suma+=i;     }    for(auto & i: b)    {     cin>>i;     minib=min(i,minib);     sumb+=i;     }    for(auto & i: c)    {     cin>>i;     minic=min(i,minic);     sumc+=i;    }    sum=suma+sumb+sumc;    sort(a,a+n1);    sort(b,b+n2);    sort(c,c+n3);    ansa=sum-2*minia-2*min(min(minib,minic),suma-minia);    ansb=sum-2*minib-2*min(min(minia,minic),sumb-minib);    ansc=sum-2*minic-2*min(min(minib,minia),sumc-minic);           cout<<max(ansa,max(ansb,ansc))<<endl;   }      int main()   {    //freopen( luka.in , r , stdin);    ios_base::sync_with_stdio(false);       cin.tie(NULL);    ll t = 1;    //cin >> t;    for (ll i = 1; i <= t; i++)    {     solve();    }    return 0;   }