//#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;


#include "boost/multiprecision/cpp_int.hpp"
#include "boost/multiprecision/cpp_dec_float.hpp"
namespace mp = boost::multiprecision;
typedef mp::cpp_int LL;
typedef mp::number<mp::cpp_dec_float<1024>> DD;// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)


typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
template<class T,class S>
inline bool chmax(T &a, S b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T,class S>
inline bool chmin(T &a, S b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

void mod_print(ll k){
    ll P=1000;
    rep(y,1,P){
        ll x=mod(y*k);
        if(x+P>=i_7){
            x-=i_7;
        }
        if(abs(x)<=P){
            cout<<x<<"/"<<y<<endl;
            return;
        }
    }
    cout<<"nun"<<endl;
}
#define all(c) c.begin(),c.end()
//////////////////////////


template<typename T, typename Func_mv>
struct Segtree {
    ll n, n_org;
    vector<T> dat;
    Func_mv merge_values;  //dataとdataの演算
    T te; //dataの単位元かつ初期値
 
    Segtree(){}
    Segtree(ll n_org,
                Func_mv merge_values,
                T te):
                n_org(n_org),
                merge_values(merge_values),
                te(te){
        n = 1;
        while(n < n_org) n <<= 1;
        dat.resize(2*n-1, te);
    }
 
    void build(vector<T>& A){
        for(ll k=0; k<ll(A.size()); k++) dat[k+n-1] = A[k];
        for(ll k=n-2; k>=0; k--) dat[k] = merge_values(dat[2*k+1], dat[2*k+2]);
    }
    void update(ll k, T x){ //位置kの要素を更新
        k+=n-1;
        dat[k]=x;
        while(k>0){
            k=(k-1)/2;
            dat[k]=merge_values(dat[2*k+1],dat[2*k+2]);
        }
    }
    void add(ll k,T x){//位置kの要素に加算
        k+=n-1;
        dat[k]+=x;
        while(k>0){
            k=(k-1)/2;
            dat[k]=merge_values(dat[2*k+1],dat[2*k+2]);
        }
    }
    T get(ll a, ll b){ //[a,b]から(最小値とか和とかを)get
        return query(a, b+1, 0, 0, n);
    }
    T binary(ll val){//[0,ok]を合計するとval以上
        ll ok=n-1,ng=-1;
        while(abs(ok-ng)>1){
            ll mid=(ok+ng)/2;
            if(get(0,mid)>=val)ok=mid;
            else ng=mid;
        }
        return ok;
    }
    
private:
    T query(ll a, ll b, ll k, ll lb, ll rb){
        if(rb<=a || b<=lb) return te;
        if(a<=lb && rb<=b) return dat[k];
        ll mb = (lb+rb)>>1;
        T vl = query(a, b, 2*k+1, lb, mb);
        T vr = query(a, b, 2*k+2, mb, rb);
        return merge_values(vl, vr);
    }
};
auto make_segtree = [](ll N){
    //点更新と区間和
    using T=ll;
    auto merge_values=[](T&a,T&b){return a+b;};
    T te=0;
    return Segtree<T, decltype(merge_values)>
        (N, merge_values, te);
};

struct coin{
    ll a,b,c;
};
ll n;
vector<coin>co;
bool comp(coin x,coin y){
    return x.a-x.c>y.a-y.c;
}

vector<ll>cal(ll an){
    
    vector<ll>res(n);
    vector<l_l>id(n);
    rep(i,0,n-1){
        id[i]={-co[i].a,i};
    }
    SORT(id);
    ll idx[n];
    rep(i,0,n-1)idx[id[i].se]=i;
    //rep(i,0,n-1)cout<<idx[i]<<" ";cout<<endl;
    auto st = make_segtree(n);
    vector<ll> init(n);
    st.build(init);
    auto kaz = make_segtree(n);
    kaz.build(init);
    /*
    rep(i,0,n-1){
        cout<<co[i].a<<" "<<co[i].c<<"::"<<idx[i]<<endl;
    }cout<<endl;*/
    
    rep(i,0,n-1){
        st.add(idx[i],co[i].a);
        kaz.add(idx[i],1);
        //rep(j,0,n-1)cout<<kaz.get(j,j)<<" ";cout<<endl;
        
        if(i<=an-2){
            res[i]=-inf;
            continue;
        }
        res[i]=st.get(0,kaz.binary(an));
    }
   // cout<<endl;
    
    return res;
}

int main(){fastio
    ll an,bn,cn;cin>>an>>bn>>cn;
    n=an+bn+cn;
    ll ans=0;
    co.resize(n);
    rep(i,0,n-1){
        cin>>co[i].a>>co[i].b>>co[i].c;
        co[i].a-=co[i].b;
        co[i].c-=co[i].b;
        ans+=co[i].b;
    }
    sort(all(co),comp);
    
    /*for(auto x:co){
        cout<<x.a<<" "<<x.c<<endl;
    }cout<<endl;*/
    
    vector<ll>ans1=cal(an);
    rep(i,0,n-1)swap(co[i].a,co[i].c);
    reverse(all(co));
    vector<ll>ans2=cal(cn);
    reverse(all(ans2));
    
    //for(auto x:ans1)cout<<x<<" ";cout<<endl;
    //for(auto x:ans2)cout<<x<<" ";cout<<endl;
    ll mx=-inf;
    rep(i,0,n-2)chmax(mx,ans1[i]+ans2[i+1]);
    cout<<ans+mx<<endl;
    //cout<<ans<<endl;
    return 0;
}




Measured memory_bytes: 11340