// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

struct Atom {
    int x, y, z;
    friend bool operator< (const Atom &a, const Atom &b) { return a.x - a.z > b.x - b.z; }
    friend bool operator> (const Atom &a, const Atom &b) { return a.y - a.z > b.y - b.z; }
};

int N, X, Y, Z;
Atom A[MAXN];

void input()
{
    read(X); read(Y); read(Z);
    N = X + Y + Z;
    for (int i = 1; i <= N; ++i) {
        read(A[i].x); read(A[i].y); read(A[i].z);
    }
}

void solve()
{
    std::sort(A + 1, A + N + 1, [](auto a, auto b) { return a.x - a.y > b.x - b.y; });

    static LL pre[MAXN], suf[MAXN];
    std::priority_queue<Atom, vector<Atom>, std::less<Atom>> preh;
    std::priority_queue<Atom, vector<Atom>, std::greater<Atom>> sufh;

    for (int i = 1; i <= N; ++i) {
        pre[i] = pre[i - 1] + A[i].z;
        preh.push(A[i]);
        pre[i] += A[i].x - A[i].z;
        if (SZ(preh) > X) {
            Atom t = preh.top();
            pre[i] -= t.x - t.z;
            preh.pop();
        }
    }
    for (int i = N; i >= 1; --i) {
        suf[i] = suf[i + 1] + A[i].z;
        sufh.push(A[i]);
        suf[i] += A[i].y - A[i].z;
        if (SZ(sufh) > Y) {
            Atom t = sufh.top();
            suf[i] -= t.y - t.z;
            sufh.pop();
        }
    }

    LL ans = 0;
    for (int i = X; i <= N - Y; ++i) {
        chkmax(ans, pre[i] + suf[i + 1]);
    }

    printf("%lld\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("C.in", "r", stdin);
    freopen("C.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 秋来相顾尚飘蓬，未就丹砂愧葛洪。
//     -- 杜甫《赠李白》


Measured memory_bytes: 4392