#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &&x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define INSEG(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":"\n");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void PSUM(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        cin.tie(0); ios::sync_with_stdio(0);
        cout << setprecision(15) << fixed;
        // #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

signed main() {
    int X, Y, Z;
    cin >> X >> Y >> Z;
    int N = X + Y + Z;
    vector<vector<int>> A(N, vector<int>(3));
    cin >> A;

    vector<pii> a(N);
    REP(i, N) {
        a[i] = {A[i][0] - A[i][1], i};
    }
    sort(ALL(a));

    vector<int> silver(N, -INF), gold(N, -INF);
    priority_queue<pii> pq;
    {
        int s = 0, b = 0;
        REP(i, N) {
            int L = i + 1;
            int idx = a[i].second;
            int val = A[idx][2] - A[idx][1];
            if (pq.size() >= Y) {
                int tv, ti;
                tie(tv, ti) = pq.top();
                if (tv >= val) {
                    s -= A[ti][1];
                    b += A[ti][2];
                    pq.pop();
                    pq.push({val, idx});
                    s += A[idx][1];
                } else {
                    b += A[idx][2];
                }
            } else {
                pq.push({val, idx});
                s += A[idx][1];
            }
            if (L >= Y) {
                silver[i] = s + b;
            }
        }
    }
    {
        while (pq.size()) pq.pop();
        int g = 0, b = 0;
        REPR(i, N - 1) {
            int R = N - i;
            int idx = a[i].second;
            int val = A[idx][2] - A[idx][0];
            if (pq.size() >= X) {
                int tv, ti;
                tie(tv, ti) = pq.top();
                if (tv >= val) {
                    g -= A[ti][0];
                    b += A[ti][2];
                    pq.pop();
                    pq.push({val, idx});
                    g += A[idx][0];
                } else {
                    b += A[idx][2];
                }
            } else {
                pq.push({val, idx});
                g += A[idx][0];
            }
            if (R >= X) {
                gold[i] = g + b;
            }
        }
    }

    int ans = 0;
    REP(i, N - 1) {
        int tmp = silver[i] + gold[i + 1];
        chmax(ans, tmp);
    }
    cout << ans << endl;
    return (0^_^0);
}



Measured memory_bytes: 10996