#include <bits/stdc++.h>
using namespace std;
using namespace std;
vector<long long> v;
long long getlis() {
  vector<long long> lis;
  long long l = 0, r = v.size() - 1;
  for (long long j = 0; j < v.size(); j++) {
    auto z = upper_bound(lis.begin(), lis.end(), v[j]);
    if (z == lis.end())
      lis.push_back(v[j]);
    else
      *z = v[j];
  }
  return lis.size();
}
void solve() {
  long long k1, k2, k3;
  cin >> k1 >> k2 >> k3;
  vector<long long> a, b, c;
  for (long long i = 0; i < k1; i++) {
    long long x;
    cin >> x;
    a.push_back(x);
  }
  sort(a.begin(), a.end());
  for (long long i = 0; i < k2; i++) {
    long long x;
    cin >> x;
    b.push_back(x);
  }
  sort(b.begin(), b.end());
  for (long long i = 0; i < k3; i++) {
    long long x;
    cin >> x;
    c.push_back(x);
  }
  sort(c.begin(), c.end());
  for (auto i : a) v.push_back(i);
  for (auto i : b) v.push_back(i);
  for (auto i : c) v.push_back(i);
  long long x = getlis();
  cout << k1 + k2 + k3 - x << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long tests = 1;
  while (tests--) {
    solve();
  }
}
