#include "bits/stdc++.h"
#include <random>
using namespace std;
using ll    =long long;    using dd   =double;        using pll    =pair<ll, ll>;  using tll    =tuple<ll,ll,ll>;
using vll   =vector<ll>;   using vdd  =vector<dd>;    using vpll   =vector<pll>;   using vtll   =vector<tll>;
using vvll  =vector<vll>;  using vvdd =vector<vdd>;   using vvpll  =vector<vpll>;  using vvtll  =vector<vtll>;
using vvvll =vector<vvll>; using vvvdd=vector<vvdd>;  using vvvpll =vector<vvpll>; using vvvtll =vector<vvtll>;
using vvvvll=vector<vvvll>;using vvvvdd=vector<vvvdd>;using vvvvpll=vector<vvvpll>;using vvvvtll=vector<vvvtll>;

constexpr ll INF = 1LL << 60;
constexpr dd EPS = 1e-11;
constexpr dd PI  = 3.1415926535897932;

//cin,cout高速化のおまじない＋桁数指定
struct Fast{
	Fast(){
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast;

#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, S, E)  for (ll i = (S); i <= (E); i++)
#define REP(i, N) REPS(i, 0, (N)-1)
#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)
#define dep(i, E, S)  for (ll i = (E); i >= (S); i--)
#define DEP(i, N) DEPS(i, 0, (N)-1)
#define EACH(e, v) for (auto&& e : v)
#define each(e, v) for (auto&& e : v)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T>&v,ll S,ll E){T m=v[S]; REPS(i,S,E)chmax(m,v[i]); return m;}//v[S]～v[E]の最大値
template<class T> inline T MinE(vector<T>&v,ll S,ll E){T m=v[S]; REPS(i,S,E)chmin(m,v[i]); return m;}//v[S]～v[E]の最小値
template<class T> inline T MaxE(vector<T> &v, ll N) { return MaxE(v, 0, N - 1); } //先頭N個中の最大値
template<class T> inline T MinE(vector<T> &v, ll N) { return MinE(v, 0, N - 1); }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v, (ll)v.size()); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v, (ll)v.size()); }
template<class T> inline ll MaxI(vector<T>&v,ll S,ll E){ll m=S; REPS(i,S,E){if(v[i]>v[m])m=i;} return m;}
template<class T> inline ll MinI(vector<T>&v,ll S,ll E){ll m=S; REPS(i,S,E){if(v[i]<v[m])m=i;} return m;}
template<class T> inline ll MaxI(vector<T> &v, ll N) { return MaxI(v, 0, N - 1); }
template<class T> inline ll MinI(vector<T> &v, ll N) { return MinI(v, 0, N - 1); }
template<class T> inline ll MaxI(vector<T> &v) { return MaxI(v, (ll)v.size()); }
template<class T> inline ll MinI(vector<T> &v) { return MinI(v, (ll)v.size()); }
template<class T> inline T Sum(vector<T> &v, ll S,ll E){ T s=v[S]; REPS(i,S+1,E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v, ll N) { return Sum(v, 0, N - 1); }
template<class T> inline T Sum(vector<T> &v) { return Sum(v, v.size()); }
template<class T> inline ll sz(T &v){ return (ll)v.size(); }
template<class T> inline T POW(T a, ll n){ T r=1; for (; n>0; n>>=1, a*=a){ if (n&1)r*=a; } return r; }
inline ll POW(int a, ll n){ return POW((ll)a, n); }
inline ll CEIL(ll a, ll b){ return (a+b-1)/b; }
ll Gcd(ll a, ll b){ return (b==0) ? a : Gcd(b, a%b); }
ll Lcm(ll a, ll b){ return a * b / Gcd(a, b); }
inline ll MSB(ll a){for(ll o=63,x=-1;;){ll m=(o+x)/2; if(a<(1LL<<m))o=m; else x=m; if(o-x==1)return x;}}
inline ll Upper2N(ll s) { return 1LL<<MSB(s)<<1; }//s<2^nなる最小の2^n
inline vll Bit2Idx(ll m){vll v; for(ll i=0;m;m>>=1,i++) if(m&1)v.push_back(i); return move(v);}
inline ll BitNum(ll m){ for (ll c=0;; m>>=1){ c+=m&1; if (!m)return c; } }
inline ll Bit(ll s, ll i){ return (s>>i)&1; } //sの第ibit i=0-63
[[nodiscard]] inline ll BitOn(ll s, ll i){ return s|(1LL<<i); } //sの第ibitON i=0-63
[[nodiscard]] inline ll BitOff(ll s, ll i){ return s&~(1LL<<i); } //sの第ibitOFF i=0-63
[[nodiscard]] inline ll BitCut(ll s, ll i){ return s & (1LL<<++i)-1; }//sの第0～第ibitを抽出
inline vll str2num(string &s, ll N) {vll v(N); REP(i, N) v[i]=(ll)(s[i]-'0'); return move(v);}
inline vll ALP2num(string &s, ll N) {vll v(N); REP(i, N) v[i]=(ll)(s[i]-'A'); return move(v);}
inline vll alp2num(string &s, ll N) {vll v(N); REP(i, N) v[i]=(ll)(s[i]-'a'); return move(v);}
template<class T> inline ll FloorIdx(vector<T> &v, T x){ return upper_bound(ALL(v), x)-v.begin()-1; }
template<class T> inline ll CeilIdx(vector<T> &v, T x){ return lower_bound(ALL(v), x)-v.begin(); }
template<class T> inline ll UnderNumOf(vector<T> &v, T x){ //sort済vのx以下の個数を得る
	return upper_bound(v.begin(), v.end(), x) - v.begin(); }
template<class T, class Pr> inline ll UnderNumOf(vector<T> &v, T x, Pr pred){ //x以下個数
	return upper_bound(v.begin(), v.end(), x, pred) - v.begin(); }
template<class T> inline ll OverNumOf(vector<T> &v, T x){ //sort済vのx以上の個数を得る
	return (ll)v.size() - (lower_bound(v.begin(), v.end(), x) - v.begin()); }
template<class T, class Pr> inline ll OverNumOf(vector<T> &v, T x, Pr pred){ //x以上の個数
	return (ll)v.size() - (lower_bound(v.begin(), v.end(), x, pred) - v.begin()); }

template<class T=ll> inline vector<T> cinv(ll N){ vector<T> v(N); REP(i, N)cin>>v[i]; return move(v);}
template<class T, class S> inline vector<pair<T, S>> cinv2(ll N){
	vector<pair<T, S>> v(N); REP(i,N){cin>>v[i].first>>v[i].second;} return move(v); }
template<class T> inline vector<T> cinv2(ll N){
	vector<T> v(N); REP(i, N){ll a, b; cin>>a>>b; v[i]={a,b};} return move(v);}
template<class T,class S,class R> inline vector<tuple<T, S, R>> cinv3(ll N){
	vector<tuple<T,S,R>> v(N); REP(i,N){cin>>get<0>(v[i])>>get<1>(v[i])>>get<2>(v[i]);} return move(v);}
template<class T> inline vector<T> cinv3(ll N){
	vector<T> v(N); REP(i, N){ll a,b,c; cin>>a>>b>>c; v[i]={a,b,c};} return move(v);}
template<class T,class S,class R,class Q> inline vector<tuple<T,S,R,Q>> cinv4(ll N){
	vector<tuple<T,S,R,Q>> v(N); REP(i,N){cin>>get<0>(v[i])>>get<1>(v[i])>>get<2>(v[i])>>get<3>(v[i]);} return move(v);}
template<class T> inline vector<T> cinv4(ll N){
	vector<T> v(N); REP(i, N){ll a,b,c,d; cin>>a>>b>>c>>d; v[i]={a,b,c,d};} return move(v);}
template<class T=ll> inline vector<vector<T>> cinvv(ll N, ll M){
	vector<vector<T>> vv(N); REP(i, N) vv[i] = cinv(M); return move(vv);}
template<class T> inline void coutv(vector<T> &v, string d=" "){
	ll N=(ll)v.size(); REP(i,N){cout << v[i] << ((i==N-1)?"":d);} cout<<'\n';}
template<class T> inline void coutv(deque<T> &v, string d=" "){
	ll N=(ll)v.size(); REP(i,N){cout << v[i] << ((i==N-1)?"":d);} cout<<'\n';}
template<class T> void bye(T a){cout << a << '\n'; exit(0);}
#if defined(_DEBUG)
ll dumpW = 5;
template<class T> void Dump(vector<T> &v){
	REP(i, (ll)v.size()) { cerr << ((i==0)?"[":" ") << setw(dumpW) << v[i]; }  cerr << "]";
}
void Dump(vll &v){
	REP(i, (ll)v.size()) {
		cerr << ((i==0)?"[":" ") << setw(dumpW);
		if       (v[i] == INF) cerr << "INF";
		else if (v[i] == -INF) cerr << "-INF";
		else                   cerr << v[i];
	}  cerr << "]";
}
template<class T> void Dump(vector<vector<T>> &v){
	ll N=(ll)v.size();  string d[2][2]={{" ", "["},  {"\n", "]\n"}};
	REP(i, N) { cerr << d[0][i==0];  Dump(v[i]);  cerr << d[1][i==N-1]; }
}
template<class T> void Dump(vector<vector<vector<T>>> &v){
	ll N=(ll)v.size();  string d[2]={"  <", "[ <"};
	REP(i, N) { cerr << d[i==0] << i << ">\n"; Dump(v[i]); }  cerr << "]\n";
}
template<class T> void Dump(vector<vector<vector<vector<T>>>> &v){
	ll N=(ll)v.size();  string d[2]={"  ---<", "[ ---<"};
	REP(i, N) { cerr << d[i==0] << i << ">---\n"; Dump(v[i]); }  cerr << "]\n";
}
template<class T> void Dump(vector<vector<vector<vector<vector<T>>>>> &v){
	ll N=(ll)v.size();  string d[2]={"  ======<", "[ ======<"};
	REP(i, N) { cerr << d[i==0] << i << ">======\n"; Dump(v[i]); }  cerr << "]\n";
}
template<class T, class S> void Dump(map<T, S> &m){
	for(auto e: m) cout << e.first << " : " << e.second << '\n';
}
#else
template<class T> void Dump(vector<T> &v){}
template<class T> void Dump(vector<vector<T>> &v){}
template<class T> void Dump(vector<vector<vector<T>>> &v){}
template<class T> void Dump(vector<vector<vector<vector<T>>>> &v){}
template<class T> void Dump(vector<vector<vector<vector<vector<T>>>>> &v){}
#endif

template<ll MOD> struct mll_{
	ll val;
	mll_(ll v = 0): val(v % MOD){ if (val < 0) val += MOD; }
	mll_ operator - () const { return -val; }
	mll_ operator + (const mll_ &b) const { return val + b.val; }
	mll_ operator - (const mll_ &b) const { return val - b.val; }
	mll_ operator * (const mll_ &b) const { return val * b.val; }
	mll_ operator / (const mll_ &b) const { return mll_(*this) /= b; }
	mll_ operator + (ll b) const { return *this + mll_(b); }
	mll_ operator - (ll b) const { return *this - mll_(b); }
	mll_ operator * (ll b) const { return *this * mll_(b); }
	friend mll_ operator + (ll a, const mll_ &b) { return b + a; }
	friend mll_ operator - (ll a, const mll_ &b) { return -b + a; }
	friend mll_ operator * (ll a, const mll_ &b) { return b * a; }
	friend mll_ operator / (ll a, const mll_ &b) { return mll_(a)/b; }
	mll_ &operator += (const mll_ &b) { val=(val+b.val)%MOD; return *this; }
	mll_ &operator -= (const mll_ &b) { val=(val+MOD-b.val)%MOD; return *this; }
	mll_ &operator *= (const mll_ &b) { val=(val*b.val)%MOD; return *this; }
	mll_ &operator /= (const mll_ &b) {
		ll c=b.val, d=MOD, u=1, v=0;
		while (d){
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll_ &operator += (ll b) { return *this += mll_(b); }
	mll_ &operator -= (ll b) { return *this -= mll_(b); }
	mll_ &operator *= (ll b) { return *this *= mll_(b); }
	mll_ &operator /= (ll b) { return *this /= mll_(b); }
	bool operator == (const mll_ &b) { return val == b.val; }
	bool operator != (const mll_ &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll_(b); }
	bool operator != (ll b) { return *this != mll_(b); }
	friend bool operator == (ll a, const mll_ &b) { return mll_(a) == b.val; }
	friend bool operator != (ll a, const mll_ &b) { return mll_(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll_ &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll_ &a) { return is >> a.val; }
	static mll_ Combination(ll a, ll b){
		chmin(b, a-b);
		if (b<0) return mll_(0);
		mll_ c = 1;
		REP(i, b) c *= a-i;
		REP(i, b) c /= i+1;
		return c;
	}
};
using mll = mll_<1000000007LL>; //1000000007LL;// 998244353LL;
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;
using vvvvvmll = std::vector<vvvvmll>;

vll maxAry;

ll calc2(ll x, ll y, ll z, vtll &abc)
{
	ll n=x+y+z;
	vll idxAry;
	//vll maxAry;
	rep(i, 0, x-1) idxAry.push_back(0);
	rep(i, 0, y-1) idxAry.push_back(1);
	rep(i, 0, z-1) idxAry.push_back(2);
	ll ans=0;
	do{
		ll val=0;
		rep(j, 0, n-1){
			vll z(3);
			tie(z[0], z[1], z[2]) = abc[j];

			ll v=idxAry[j];
			val+=z[v];
		}
		if (chmax(ans, val)) maxAry=idxAry;
	} while (next_permutation(idxAry.begin(), idxAry.end()));
	//cout << ans << '\n';
	return ans;
}

ll calc(ll x,ll y,ll z,vtll &abc)
{
	//ll x, y, z;  cin >> x >> y >> z;
	ll n=x+y+z;
	//vector<tuple<ll, ll, ll>> abc = cinv3<ll, ll, ll>(n);
#if 0
	if (x<y){
		swap(x, y);
		each(e, abc) swap(get<0>(e), get<1>(e));
	}
	if (x<z){
		swap(x, z);
		each(e, abc) swap(get<0>(e), get<2>(e));
	}
	if (y<z){
		swap(y, z);
		each(e, abc) swap(get<1>(e), get<2>(e));
	}
#endif
	ll asum=0;
	vector<tll> kbc;
	each(e, abc){
		ll a, b, c;  tie(a, b, c) = e;
		asum+=a;
		kbc.emplace_back(0,b-a, c-a);
	}
	sort(ALL(kbc), [](tll &a, tll &b){
		return get<2>(a)-get<1>(a) > get<2>(b)-get<1>(b); 
	});
	rep(k, 0, n-1){
		get<0>(kbc[k])=k;
	}
	vtll kbc_b=kbc;
	vtll kbc_c=kbc;
	sort(ALL(kbc_b), [](tll &a, tll &b){return get<1>(a)>get<1>(b); });
	sort(ALL(kbc_c), [](tll &a, tll &b){return get<2>(a)>get<2>(b); });

	//bのset準備
	ll bnm=y;
	ll bsum=0;
	set<ll> bset;
	rep(j, 0, y-1){
		ll k,b,c;  tie(k,b,c) = kbc_b[j];
		bsum+=b;
		bset.insert(k);
	}

	//cのset準備
	ll cnm=0;
	ll csum=0;
	set<ll> cset;
	set<ll> qb, qc;
	rep(j, 0, INF){
		if (cnm-sz(qb)-sz(qc)==z)break;
		ll k,b,c;  tie(k,b,c) = kbc_c[j];
		cnm++;
		cset.insert(k);
		if (bset.count(k)==1){
			qb.insert(k);
		}
		else {
			csum+=c;
		}
	}
	//共通setに追加する関数
	auto addset = [&](ll k){
		//qcに入れる
		qc.insert(k);
		{
			ll _, b, c;  tie(_, b, c) = kbc[k];
			csum+=(c-b);
		}
		//qcの末尾をqbに移動
		{
			auto it=qc.end();
			it--;
			ll kk=*it;
			qc.erase(it);
			qb.insert(kk);
			ll _, b, c;  tie(_, b, c) = kbc[kk];
			csum-=(c-b);
		}
	};
	//共通setを1つずらす関数
	auto shiftset = [&](){
		if (qb.empty()) return false;

		auto it=qb.begin();
		ll k=*it;
		qb.erase(it);
		qc.insert(k);
		ll _, b, c;  tie(_, b, c) = kbc[k];
		csum+=c-b;
		return true;
	};
	//共通setから削除する関数
	auto delset = [&](ll k){
		if (qc.count(k)==1){
			qc.erase(k);
			ll _, b, c;  tie(_, b, c) = kbc[k];
			csum-=c-b;
			return shiftset();
		}
		else {
			qb.erase(k);
		}
		return true;
	};

	ll ans=asum+bsum+csum;

	//本体
	rep(i, 1, z){//i 共通分のうちcにする個数
		//bを1つ増やす
		{
			ll k, b, c;  tie(k, b, c) = kbc_b[bnm];
			bnm++;
			bsum+=b;
			if (cset.count(k)==1){
				csum-=c;
				addset(k);
			}
			if (i>sz(qb)+sz(qc))break;
		}
		//共通setのqcを1つ増やす
		if (!shiftset()) break;

		//cを適切に減らす
		while (cnm-sz(qb)!=z){
			cnm--;
			ll k, b, c;  tie(k, b, c) = kbc_c[cnm];
			cset.erase(k);
			if (qb.count(k)==1 or qc.count(k)==1){
				if (!delset(k)) goto loopend;
			}
			else {
				csum-=c;
			}
		}

		chmax(ans, asum+bsum+csum);
	}
loopend:
	//cout << ans << '\n';
	return ans;
}

void solve()
{
#if 1
	ll x, y, z;  cin >> x >> y >> z;
	ll n=x+y+z;
	vector<tuple<ll, ll, ll>> abc = cinv3<ll, ll, ll>(n);
	ll ans1=calc(x, y, z, abc);
	//ll ans2=calc2(x, y, z, abc);
	cout << ans1 << '\n';
	//cout << ans2 << '\n';
#else
	//random_device rnd;
	mt19937 mt(0);
	while (true){
		ll x=mt()%2+1;
		ll y=mt()%2+1;
		ll z=mt()%2+1;
		ll n=x+y+z;
		vtll abc;
		rep(i, 0, n-1){
			ll v1=mt()%99+1;
			ll v2=mt()%99+1;
			ll v3=mt()%99+1;
			abc.emplace_back(v1,v2,v3);
		}
		ll ans1=calc(x, y, z, abc);
		ll ans2=calc2(x, y, z, abc);
		if (ans1!=ans2){
		//if (1){
			cout << "different!" << '\n';
			coutv(maxAry);
			cout << ans1 << " " << ans2 << '\n';
			cout << x << " " << y << " " << z << '\n';
			rep(i, 0, n-1){
				ll a, b, c;  tie(a, b, c) = abc[i];
				cout << a << " " << b << " " << c << '\n';
			}
		}
	}
#endif
}


int main(){
#if 1
	solve();
#else
	ll t;  cin >> t;
	rep(i, 0, t-1){
		solve();
	}
#endif
	return 0;
}


Measured memory_bytes: 24660