#include <bits/stdc++.h>
using namespace std;
int a[200001], k1, k2, k3, g, t1, t2, t3, c1, c2, c3, a1, a2, a3, bed[200001],
    n, ans, bse;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ans = INT_MAX;
  cin >> k1 >> k2 >> k3;
  n = k1 + k2 + k3;
  for (int i = 1; i <= k1; i++) {
    cin >> g;
    a[g] = 1;
  }
  for (int i = 1; i <= k2; i++) {
    cin >> g;
    a[g] = 2;
  }
  for (int i = 1; i <= k3; i++) {
    cin >> g;
    a[g] = 3;
  }
  c1 = 0, c2 = 0, c3 = 0;
  for (int i = n; i >= 1; i--) {
    if (a[i] == 1) c1++;
    if (a[i] == 2) c2++;
    if (a[i] == 3) c3++;
    bed[i] = c2 - c3;
    if (i != n) bed[i] = min(bed[i], bed[i + 1]);
  }
  t1 = c1, t2 = c2, t3 = c3;
  c1 = 0, c2 = 0, c3 = 0;
  a[0] = 0;
  for (int l = 0; l <= n; l++) {
    if (a[l] == 1) c1++;
    if (a[l] == 2) c2++;
    if (a[l] == 3) c3++;
    a1 = t1 - c1;
    a2 = t2 - c2;
    a3 = t3 - c3;
    bse = c2 + c3 + a1 + a3;
    ans = min(ans, min(bse + bed[l + 1], bse));
  }
  cout << ans << endl;
  cout.flush();
  return 0;
}
