#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;

//int sum(int a, int b) { return a + b; }
void solve() {
	int X, Y, Z; cin >> X >> Y >> Z;
	int N = X + Y + Z;
	vector<int>A(N), B(N), C(N);
	REP(i, N) {
		cin >> A[i] >> B[i] >> C[i];
	}
	//金-銀でソート
	vector<pii>gs(N);
	REP(i, N) {
		gs[i] = { A[i] - B[i],i };
	}
	VSORT(gs);
	VREVERSE(gs);
	vector<int>resA(N + 1), resB(N + 1);//resA[k]=gsの上位k人で区切った時の答 resB[N-k]=gsの下位k人で区切った時の答
	priority_queue<pii, vector<pii>, greater<pii>>qA,qB;
	int res = 0;
	REP(i, X) {
		int idx = gs[i].second;
		res += A[idx];
		qA.push({ A[idx] - C[idx],idx });
	}
	resA[X] = res;
	FOR(i, X, N) {
		int idx = gs[i].second;
		pii p = qA.top();
		int d = A[idx] - C[idx];
		res = resA[i];
		if (d > p.first) {
			qA.pop();
			qA.push({ d,idx });
			res -= A[p.second];
			res += C[p.second];
			res += A[idx];
		}
		else {
			res += C[idx];
		}
		resA[i + 1] = res;
	}
	res = 0;
	FORR(i,N, N - Y) {
		int idx = gs[i].second;
		res += B[idx];
		qB.push({ B[idx] - C[idx],idx });
	}
	resB[N - Y] = res;
	REPR(i, N - Y) {
		int idx = gs[i].second;
		pii p = qB.top();
		int d = B[idx] - C[idx];
		res = resB[i + 1];
		if (d > p.first) {
			qB.pop();
			qB.push({ d,idx });
			res -= B[p.second];
			res += C[p.second];
			res += B[idx];
		}
		else res += C[idx];
		resB[i] = res;
	}
	ll ans = 0;
	FOR(k, X, N - Y+1) {
		chmax(ans, resA[k] + resB[k]);
	}
	print(ans);
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q;
	//cin >> q;
	//while (q--)
	solve();
}


Measured memory_bytes: 11012