//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = true;
}  // namespace mydef
using namespace mydef;
#define pb push_back
//#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans

int X, Y, Z;
struct P {
    int a, b, c;
};
vector<P> V;
vi l, r;

void f(int X, int Y, vector<P> V, vi& l) {
    auto f = [](pi x, pi y) { return x.first - x.second < y.first - y.second; };
    priority_queue<pi, vp, decltype(f)> que{f};
    int tot = 0;
    int cnt = 1;
    for (int i = 0;; i++) {
        auto p = make_pair(V[i].a, V[i].b);
        if (que.size() < Y) {
            tot += p.second;
            que.push(p);
        } else if ((que.top().first - que.top().second) > (p.first - p.second)) {
            tot += p.second - que.top().second + que.top().first;
            que.pop();
            que.push(p);
        } else
            tot += p.first;
        if (cnt >= Y)
            l[cnt] = tot;
        cnt++;
        if (cnt > X + Y)
            break;
    }
}

void solve() {
    sort(all(V), [](P x, P y) { return x.b - x.c > y.b - y.c; });
    l.resize(X + Y + 1);
    r.resize(X + Z + 1);
    f(X, Y, V, l);
    reverse(all(V));
    for (auto& x : V) {
        swap(x.b, x.c);
    }
    f(X, Z, V, r);
    int ans = 0;
    for (int i = Y;; i++) {
        int j = X + Y + Z - i;
        if (j < Z)
            break;
        //cerr << l[i] << " " << r[j] << endl;
        chmax(ans, l[i] + r[j]);
    }
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> X >> Y >> Z;
    for (int i = 0; i < X + Y + Z; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        V.emplace_back(P{a, b, c});
    }

    solve();
    return 0;
}


Measured memory_bytes: 12036