#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	int x, y, z; cin >> x >> y >> z;
	vector<tuple<int,int,int>> v;
	int n = x + y + z;
	rep(i, n){
		int a, b, c; cin >> a >> b >> c;
		v.emplace_back(a, b, c);
	}
	vi ordY, ordZ;
	rep(i, n) ordY.pb(i), ordZ.pb(i);
	
	auto diff = [&](int i, int a, int b){
		int x = a ? a == 2 ? get<2>(v[i]) : get<1>(v[i]) : get<0>(v[i]);
		int y = b ? b == 2 ? get<2>(v[i]) : get<1>(v[i]) : get<0>(v[i]);
		return x - y;
	};
	sort(all(ordY), [&](int a, int b){
		return diff(a, 1, 0) > diff(b, 1, 0);
	});
	sort(all(ordZ), [&](int a, int b){
		return diff(a, 2, 0) > diff(b, 2, 0);
	});
	
	set<pi> L, R;
	ll tmp = 0;
	priority_queue<pi> q;
	for(int i = y + z; i < n; i++){
		int p = ordY[i];
		q.emplace(diff(p, 2, 0), p);
	}
	rep(i, n) tmp += get<0>(v[i]);
	
	
	auto add = [&](int idx){
		tmp -= get<0>(v[idx]);
		int sc = diff(idx, 2, 1);
		if(R.empty() || sc < R.begin()->first){
			tmp += get<1>(v[idx]);
			L.emplace(sc, idx);
		}
		else{
			tmp += get<2>(v[idx]);
			R.emplace(sc, idx);
		}
		while(L.size() > y){
			tmp += L.rbegin()->first;
			R.emplace(*L.rbegin());
			L.erase(*L.rbegin());
		}
	};
	auto erase = [&](int idx){
		tmp += get<0>(v[idx]);
		int sc = diff(idx, 2, 1);
		pi p = pi(sc, idx);
		if(L.count(p)){
			tmp -= get<1>(v[idx]);
			L.erase(p);
		}
		if(R.count(p)){
			tmp -= get<2>(v[idx]);
			R.erase(p);
		}
		while(L.size() < y && R.size()){
			tmp -= R.begin()->first;
			L.emplace(*R.begin());
			R.erase(*R.begin());
		}
	};
	
	rep(i, y + z) add(ordY[i]);
	
	ll ans = tmp;
	for(int i = y + z - 1; i >= 0; i--){
		
		//dbg(L);dbg(R);dbg(ordY[i]);
		
		q.emplace(diff(ordY[i], 2, 0), ordY[i]); //dbg(q.top());
		erase(ordY[i]);
		add(q.top().second); q.pop();
		ans = max(ans, tmp);
		/*
		dbg(y, z, L.size(), R.size());
		assert(L.size() == y);
		assert(R.size() == z);
		ll s = 0;
		rep(j, n) s += get<0>(v[j]);
		for(auto p : L) s += diff(p.second, 1, 0);
		for(auto p : R) s += diff(p.second, 2, 0);
		dbg(tmp, s);
		*/
	}
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 7028