#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;

template <
        class T,
        class Container = std::vector<T>,
        class Compare = std::less<typename Container::value_type>
>
struct PriorityQueueSum{
    priority_queue<T, Container, Compare> pq;
    T sum;

    explicit PriorityQueueSum(const T initialValue):sum(initialValue){}

    void push(const T &x) {
        sum += x;
        pq.push(x);
    }
    T top(){
        return pq.top();
    }
    T pop(){
        T x = pq.top();
        pq.pop();
        sum -= x;
        return x;
    }
    T getSum(){
        return sum;
    }
    bool empty(){
        return pq.empty();
    }
    size_t size(){
        return pq.size();
    }
};

int T, n, m, x, y, z;

vl calc(vector<pll> v, int c){
    // from beneficial B to beneficial C
    PriorityQueueSum<ll, vector<ll>, greater<ll>> pq(0ll);
    vl ans(1, -(1ll << 50));
    for(auto x : v){
        pq.push(x.first);
        if(c < pq.size()) pq.pop();
        ans.pb(c == pq.size() ? pq.getSum() : -(1ll << 50));
    }
    return ans;
}

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    cin >> x >> y >> z;
    n = x + y + z;
    ll ans = 0;
    vector<pll> v;
    REP(i, n){
        int a, b, c;
        cin >> a >> b >> c;
        ans += a;
        v.eb(b - a, c - a);
    }
    sort(RALL(v), [&](const pii &a, const pii &b){
        return a.first - a.second < b.first - b.second;
    });
    auto left = calc(v, y);
    reverse(ALL(v));
    REP(i, n) swap(v[i].first, v[i].second);
    auto right = calc(v, z);
    ll ma = -(1ll << 50);
    REP(i, n + 1) ma = max(ma, left[i] + right[n - i]);
    cout << ans + ma << endl;
    return 0;
}


Measured memory_bytes: 6612