func_code_string: #include<bits/stdc++.h>   #define ll long long   #define F first   #define S second   #define endl   n    using namespace std;   const ll mod=1e9+7;   const int N=5+3e5;   const int INF=1e9;   ll a[3][N],s[3],n[3];   int x[3]= {0,1,2};   int main()   {   #ifdef LOCAL       freopen( input.in ,  r , stdin);   #endif       ll m1,m2,ans=-1e18;       cin>>n[0]>>n[1]>>n[2];       for(int i=0; i<n[0]; ++i)       {           cin>>a[0][i];           s[0]+=a[0][i];       }       for(int i=0; i<n[1]; ++i)       {           cin>>a[1][i];           s[1]+=a[1][i];       }       for(int i=0; i<n[2]; ++i)       {           cin>>a[2][i];           s[2]+=a[2][i];       }          sort(a[0],a[0]+n[0]);       sort(a[1],a[1]+n[1]);       sort(a[2],a[2]+n[2]);          do       {           m1=a[x[1]][0]-(s[x[0]]-a[x[0]][n[x[0]]-1]+s[x[2]]-a[x[2]][0]);           m2=a[x[2]][0]-(s[x[1]]-a[x[1]][0]);           if(m1>m2)               swap(m1,m2);           if(m2>=0)               ans=max(ans,a[x[0]][n[x[0]]-1]-(m1-m2));           else               ans=max(ans,a[x[0]][n[x[0]]-1]-m1-m2);       }       while(next_permutation(x,x+3));       cout<<ans<<  n ;                           }   