#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll;
typedef vector<vector<long long> > vvll;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i,n) _rep2((i),0,(n))
#define _rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

void mainmain(){
    int x,y,z;
    cin>>x>>y>>z;
    int n = x+y+z;
    vvint vv;
    initvv(vv, n, 3);
    vector<pii> v(n);
    rep(i,n){
        rep(j,3) cin>>vv[i][j];
        v[i] = pii(vv[i][0]-vv[i][1], i);
    }
    sort(ALL(v));
    ll ans = 0;
    vvint tmp = vv;
    rep(i,n) vv[i] = tmp[v[i].se];
    rep(i,n){
        rep(j,2) vv[i][j] -= vv[i][2];
        ans += vv[i][2];
        vv[i][2] = 0;
    }
    vll b(n);
    vll a(n);
    ll sum;
    sum = 0;
    priority_queue<ll> pq;
    rep(i,n){
        if(i<y){
            pq.push(-vv[i][1]);
            sum += vv[i][1];
        }
        else{
            if(-pq.top() >= vv[i][1]);
            else{
                sum += vv[i][1] + pq.top();
                pq.pop();
                pq.push(-vv[i][1]);
            }
        }
        b[i] = sum;
    }
    while(pq.size()) pq.pop();
    sum = 0;
    for(int i=n-1; i>=0; i--){
        if(pq.size()<x){
            pq.push(-vv[i][0]);
            sum += vv[i][0];
        }
        else{
            if(-pq.top() >= vv[i][0]);
            else{
                sum += vv[i][0] + pq.top();
                pq.pop();
                pq.push(-vv[i][0]);
            }
        }
        a[i] = sum;
    }
    ll t = -INFL;
    rep(i,y-1, n-x){
        maxs(t, b[i]+a[i+1]);
    }
    cout<<ans+t<<endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 14716