#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
const ll MOD=1e9+7;

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int x,y,z;
  cin>>x>>y>>z;
  int n=x+y+z;
  vector<ll> abc[3];
  rep(i,3) abc[i].resize(n);
  rep(i,n) cin>>abc[0][i]>>abc[1][i]>>abc[2][i];
  set<pll> st[3][3];
  rep(i,n)rep(j,3){
    int t=(i>=x)+(i>=x+y);
    st[t][j].emplace(abc[t][i]-abc[j][i],i);
  }
  function<void(int,int)> push=[&](int i,int x){
    rep(j,3) st[i][j].emplace(abc[i][x]-abc[j][x],x);
  };
  function<void(int,int)> erase=[&](int i,int x){
    rep(j,3) st[i][j].erase(pii(abc[i][x]-abc[j][x],x));
  };
  //rep(i,3){for(pii p:st[i][i]) cout<<p.Y<<",";cout<<endl;}cout<<endl;
  while(1){
    int upd=0;
    rep(i,3)rep(j,i){
      if(-st[i][j].begin()->X-st[j][i].begin()->X>0){
	int x=st[i][j].begin()->Y;
	int y=st[j][i].begin()->Y;
	erase(i,x); erase(j,y);
	push(i,y); push(j,x);
	upd=1;
      }
    }
    reps(d,1,3){
      ll sum=0;
      rep(i,3) sum-=st[i][(i+d)%3].begin()->X;
      if(sum>0){
	vector<int> xs(3);
	rep(i,3) xs[i]=st[i][(i+d)%3].begin()->Y;
	rep(i,3) erase(i,xs[i]);
	rep(i,3) push((i+d)%3,xs[i]);
	upd=1;
      }
    }
    //rep(i,3){for(pii p:st[i][i]) cout<<p.Y<<",";cout<<endl;}cout<<endl;
    if(!upd) break;
  }
  ll re=0;
  rep(i,3)for(pii p:st[i][i]) re+=abc[i][p.Y];
  cout<<re<<endl;
  return 0;
}


Measured memory_bytes: 21376