#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;

typedef long long ll;
//typedef pair<int,int> Pint;
typedef pair<ll, ll> P;
//typedef pair<ll, pair<ll, ll>> P;
//typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define revrep(i, n) for(ll i = n-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
ll INFL = 1LL << 60;//10^18 = 2^60
int INF = 1 << 30;//10^9
ll MOD = 1e9 + 7;
//ll MOD  = 998244353;
vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  x %= MOD; x += MOD; x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}
ll lcm(ll x, ll y){return x / gcd(x, y) * y % MOD;};

ll X, Y, Z;
ll N;
vector<pair<pair<ll, ll>, pair<ll, ll>>> ABC;

int main(void){
  cin >> X >> Y >> Z;
  N = X + Y + Z;
  ll Csum = 0;
  ABC.resize(N);
  vector<pair<pair<ll, ll>, pair<ll, ll>>> ABC(N);
  rep(i, N){
    cin >> ABC[i].f.s >> ABC[i].s.f >> ABC[i].s.s;
    Csum += ABC[i].s.s;
    ABC[i].f.f = ABC[i].s.f - ABC[i].f.s;
  }

  sort(ABC.begin(), ABC.end());
  vector<ll> ans(N, 0);
  ll sum = 0;
  priority_queue<ll, vector<ll>, greater<ll>> pque;
  rep(i, X){
    pque.push(ABC[i].f.s - ABC[i].s.s);
    sum += ABC[i].f.s - ABC[i].s.s;
  }
  ans[X-1] = sum;
  for(int i = X; i < N; i++){
    pque.push(ABC[i].f.s - ABC[i].s.s);
    sum += ABC[i].f.s - ABC[i].s.s;
    sum -= pque.top();
    pque.pop();
    ans[i] = sum;
  }
  priority_queue<ll, vector<ll>, greater<ll>> pque2;
  sum = 0;
  for(int i = N-1; i >= N-Y; i--){
    pque2.push(ABC[i].s.f - ABC[i].s.s);
    sum += ABC[i].s.f - ABC[i].s.s;
  }
  ans[N-Y-1] += sum;
  for(int i = N-Y-1; i >= 1; i--){
    pque2.push(ABC[i].s.f - ABC[i].s.s);
    sum += ABC[i].s.f - ABC[i].s.s;
    sum -= pque2.top();
    pque2.pop();
    ans[i-1] += sum;
  }
  ll answer = 0;

  for(int i = X-1; i < N-Y; i++){
    answer = max(answer, Csum + ans[i]);
  }
  cout << answer << endl;



}


Measured memory_bytes: 8476