#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){c=Getchar();rev|=c=='-';if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------
 
const int inf=0x3f3f3f3f;
const int N=100005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}
 
int n,X,Y,Z;
ll ans;
bool vis[N];
pii a[N],g[N];
set<pii> l,r,rl;
 
inline pii top(const set<pii> &a){return *a.begin();}
 
int main(){
#ifdef rqgao2014
	freopen("input.txt","r",stdin);
#endif
	read(X,Y,Z);
	n=X+Y+Z;
	for(int i=1;i<=n;i++){
		int x,y,z;read(x,y,z);
		ans+=z;
		a[i]=mp(x-z,y-z);
	}
	sort(a+1,a+n+1);
	reverse(a+1,a+n+1);
	for(int i=1;i<=X+Y;i++)
		ans+=a[i].FF,g[i]=mp(a[i].FF-a[i].SS,i);
	sort(g+1,g+X+Y+1);
	for(int i=1;i<=Y;i++)
		vis[g[i].SS]=1,ans-=g[i].FF;
//	debug(ans);
	for(int i=1;i<=X+Y;i++)
		if(vis[i]){
			r.insert(mp(a[i].SS,i));
			rl.insert(mp(a[i].SS-a[i].FF,i));
		}
		else{
			l.insert(mp(a[i].FF,i));
		}
	for(int i=X+Y+1;i<=n;i++){
		ll s1=0,s2=(ll)a[i].SS-top(r).FF,s3=(ll)a[i].SS-top(rl).FF-top(l).FF;
		if(s1>=s2&&s1>=s3) continue;
		if(s2>=s3){
			ans+=s2;
			int x=top(r).SS;
			r.erase(mp(a[x].SS,x));
			rl.erase(mp(a[x].SS-a[x].FF,x));
			r.insert(mp(a[i].SS,i));
			rl.insert(mp(a[i].SS-a[i].FF,i));
		}
		else{
			ans+=s3;
			int x=top(rl).SS,y=top(l).SS;
			l.erase(mp(a[y].FF,y));
			l.insert(mp(a[x].FF,x));
			r.erase(mp(a[x].SS,x));
			rl.erase(mp(a[x].SS-a[x].FF,x));
			r.insert(mp(a[i].SS,i));
			rl.insert(mp(a[i].SS-a[i].FF,i));
		}
//		debug(ans);
	}
	print(ans);
	return 0;
}

Measured memory_bytes: 10752