#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////

int main() {
	ll X, Y, Z;
	cin >> X >> Y >> Z;
	ll N = X + Y + Z;

	vector < pair<pair<ll, ll>, pair<ll, ll>>> p(N + 1);
	repn(i, N) {
		cin >> p[i].first.second >> p[i].second.first >> p[i].second.second;
		p[i].first.first = p[i].second.first - p[i].first.second;
	}

	sort(++p.begin(), p.end());
	vll A(N + 1), B(N + 1), C(N + 1);
	repn(i, N) {
		A[i] = p[i].first.second;
		B[i] = p[i].second.first;
		C[i] = p[i].second.second;

		//cout << A[i] << B[i] << C[i] << endl;
	}

	set<pair<ll, ll>> gbr, brs;
	vll coin(N + 1, 1);
	ll now = 0;
	ll ans = 0;

	repn(i, X) {
		now += A[i];
		gbr.insert({ A[i] - C[i], i });
	}
	for (ll i = X + 1; i <= N; i++) {
		coin[i] = 3;
		brs.insert({ C[i] - B[i],i });
		now += C[i];
	}

	repn(i, Y) {
		ll er = (*brs.begin()).second;
		coin[er] = 2;
		brs.erase({ C[er] - B[er],er });
		now -= C[er] - B[er];
	}

	ans = now;
	//cout << ans << endl;

	for (ll i = X + 1; i <= X + Z; i++) {
		ll er;
		if (coin[i] == 3) { er = i; }
		else { er = (*brs.begin()).second; }

		coin[er] = 2;
		brs.erase({ C[er] - B[er],er });
		now -= C[er] - B[er];
		
		coin[i] = 1;
		gbr.insert({ A[i] - C[i],i });
		now -= B[i] - A[i];
	
		ll y = (*gbr.begin()).second;
		coin[y] = 3;
		gbr.erase({A[y]-C[y],y});
		now -= A[y] - C[y];

		ans = max(now, ans);
		//cout << now << endl;
	}

	cout << ans << endl;

}

Measured memory_bytes: 15676