#include <bits/stdc++.h>
using namespace std;
long long mo(long long a) { return a % (long long)(1e9 + 7); }
long long po(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y >>= 1;
    x = (x * x) % p;
  }
  return res % p;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  vector<long long> cnt(3);
  for (long long i = 0; i < cnt.size(); i++) cin >> cnt[i];
  ;
  long long n = cnt[0] + cnt[1] + cnt[2];
  vector<long long> mem(n);
  for (long long i = 0; i < 3; i++) {
    for (long long j = 0; j < cnt[i]; j++) {
      long long x;
      cin >> x;
      x--;
      mem[x] = i;
    }
  }
  vector<long long> fi(n + 1);
  for (long long i = 1; i <= n; i++) {
    fi[i] = fi[i - 1];
    if (mem[i - 1] == 0) fi[i] = fi[i - 1] - 1;
    if (mem[i - 1] == 1) fi[i] = fi[i - 1] + 1;
  }
  for (long long i = 1; i <= n; i++) fi[i] = min(fi[i], fi[i - 1]);
  vector<long long> se(n + 1);
  for (long long i = 1; i <= n; i++) {
    se[i] = se[i - 1];
    if (mem[i - 1] == 1) continue;
    se[i]++;
  }
  vector<long long> th(n + 1);
  long long j = n - 1;
  for (long long i = 1; i <= n; i++) {
    th[i] = th[i - 1];
    if (mem[j] == 0 || mem[j] == 1) th[i]++;
    j--;
  }
  long long ans = (long long)(1e18 + 5);
  for (long long i = 0; i <= n; i++) {
    ans = min(ans, se[i] + fi[i] + th[n - i]);
  }
  cout << ans << "\n";
  return 0;
}
