#include <bits/stdc++.h>
using namespace std;
template <typename S, typename T>
void LIS(vector<T> a, S sz, S &maxLength) {
  maxLength = 1;
  vector<S> dp(sz, 1);
  vector<S> predecessor(sz, -1);
  set<pair<pair<T, S>, S>> cur;
  cur.insert({{a[0], 1}, 0});
  for (S i = 1; i < sz; i++) {
    auto it = cur.upper_bound({{a[i], -1}, -1});
    if (it == cur.begin()) {
      cur.insert({{a[i], dp[i]}, i});
      continue;
    }
    it--;
    dp[i] += (*it).first.second;
    predecessor[i] = (*it).second;
    maxLength = max(maxLength, dp[i]);
    it++;
    vector<pair<pair<T, S>, S>> toDelete;
    while ((it != cur.end()) &&
           (((*it).first.first >= a[i]) && ((*it).first.second <= dp[i]))) {
      toDelete.push_back((*it));
      it++;
    }
    for (auto i : toDelete) cur.erase(i);
    cur.insert({{a[i], dp[i]}, i});
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long k[3];
  vector<long long> a;
  cin >> k[0] >> k[1] >> k[2];
  for (long long i = 0; i < 3; i++) {
    vector<long long> temp;
    for (long long j = 0; j < k[i]; j++) {
      long long x;
      cin >> x;
      temp.push_back(x);
    }
    sort(temp.begin(), temp.end());
    for (long long i = 0; i < temp.size(); i++) a.push_back(temp[i]);
  }
  long long lis;
  LIS(a, k[0] + k[1] + k[2], lis);
  cout << (k[0] + k[1] + k[2]) - lis << endl;
  return 0;
}
