#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define llu unsigned long long
#define ld double
#define llu unsigned long long
#define rep(i,x,y)  for(int i=int(x);i<int(y);++i)
#define For(i,x,y)  for(int i=int(x);i<=int(y);++i)
#define FOr(i,x,y)  for(int i=int(x);i>=int(y);--i)
#define pi acos(-1) 
#define mk make_pair
#define pa pair<ll,ll>
#define lf else if
#define IL inline
#define max(x,y)    ((x)<(y)?(y):(x))
#define min(x,y)    ((x)<(y)?(x):(y))
#define sqr(x)      ((x)*(x))
#define Mul(x,y)    ((x)=1LL*(x)*(y)%mod)
#define Add(x,y)    ((x)=((x)+(y))%mod)
#define E(x)        return writeln(x),0
#define LL			(long long)
#define p(x)        printf("~%lld~\n",LL(x))
#define pp(x,y)     printf("~~%lld %lld~~\n",LL(x),LL(y))
#define ppp(x,y,z)  printf("~~~%lld %lld %lld~~~\n",LL(x),LL(y),LL(z))
#define pppp(a,b,c,d)	printf("~~~%lld %lld %lld %lld\n",LL(a),LL(b),LL(c),LL(d))
#define f_in(x)     freopen(x".in","r",stdin)
#define f_out(x)    freopen(x".out","w",stdout)
#define open(x)     f_in(x),f_out(x)
#define fi first
#define se second
#define GuYue		puts("\nGuYueNa________________________________________________________________________________")
#define y1			fafa____
typedef complex<double> E;
namespace SHENZHEBEI{
#ifdef LOCAL
    struct _{_(){freopen("cf.in","r",stdin);}}_; 
#endif 
#define NEG 1
    static const int GYN=2333333;
    char SZB[GYN],*S=SZB,*T=SZB;
    inline char gc(){   if (S==T){  T=(S=SZB)+fread(SZB,1,GYN,stdin); if (S==T) return '\n';  }   return *S++;    }
#if NEG
    inline ll read(){    ll x=0,g=1; char ch=gc();   for (;!isdigit(ch);ch=gc()) if (ch=='-') g=-1;  for (;isdigit(ch);ch=gc())  x=x*10-48+ch;   return x*g; }
    inline void write(ll x){    if (x<0) putchar('-'),x=-x;  if (x>=10)   write(x/10);    putchar(x%10+'0');  }
#else
    inline ll read(){    ll x=0; char ch=gc();   for (;!isdigit(ch);ch=gc());    for (;isdigit(ch);ch=gc())  x=x*10-48+ch;   return x;   }
    inline void write(ll x){    if (x>=10)   write(x/10);    putchar(x%10+'0');  }
#endif
    inline char readchar(){ char ch=gc();   for(;isspace(ch);ch=gc());  return ch;  }
    inline ll readstr(char *s){ char ch=gc();   int cur=0;  for(;isspace(ch);ch=gc());      for(;!isspace(ch);ch=gc())  s[cur++]=ch;    s[cur]='\0';    return cur; }
	void Print(long long *a,int s,int t){For(i,s,t)printf("%lld ",a[i]);}
	void Print(int *a,int s,int t){For(i,s,t)printf("%d ",a[i]);}
	void Print(char *a,int s,int t){For(i,s,t)putchar(a[i]);}
	void writeln(ll x){write(x);puts("");}
}using namespace SHENZHEBEI;
void Max(ll &x,ll y){x=x<y?y:x;}
void Min(ll &x,ll y){x=x>y?y:x;}
const ll N=1000010;
struct dt{ll a,b,c;}p[N];
ll sum,A,B,C,n,ans,pre[N],suc[N];
bool cmp(dt a,dt b){return a.a-a.b>b.a-b.b;}
multiset<ll>s;
void Init1(){
	For(i,1,A)s.insert(p[i].c-p[i].a),sum+=p[i].a;
	pre[A]=sum;
	For(i,A+1,n){
		sum+=p[i].a;		s.insert(p[i].c-p[i].a);
		sum+=*s.rbegin();	s.erase(s.find(*s.rbegin()));
		pre[i]=sum;
	}s.clear();sum=0;
}
void Init2(){
	FOr(i,n,n-B+1)s.insert(p[i].c-p[i].b),sum+=p[i].b;
	suc[n-B+1]=sum;
	FOr(i,n-B,1){
		sum+=p[i].b;		s.insert(p[i].c-p[i].b);
		sum+=*s.rbegin();	s.erase(s.find(*s.rbegin()));
		suc[i]=sum;
	}s.clear();sum=0;
}
int main(){
	A=read(),B=read(),C=read();n=A+B+C;
	For(i,1,n)p[i].a=read(),p[i].b=read(),p[i].c=read();
	sort(p+1,p+n+1,cmp);
	Init1();	Init2();
	For(i,A,n-B)Max(ans,pre[i]+suc[i+1]);
	writeln(ans);
}
/*
*/

Measured memory_bytes: 15104