#include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 5;
int a[M];
int L[10], R[10];
int main() {
  int k1, k2, k3;
  scanf("%d%d%d", &k1, &k2, &k3);
  int n = k1 + k2 + k3;
  for (int x, i = 1; i <= k1; i++) {
    scanf("%d", &x);
    a[x] = 1;
  }
  for (int x, i = 1; i <= k2; i++) {
    scanf("%d", &x);
    a[x] = 2;
  }
  for (int x, i = 1; i <= k3; i++) {
    scanf("%d", &x);
    a[x] = 3;
  }
  int ans = 0, posval = 0;
  for (int i = 1; i <= n; i++)
    if (a[i] != 3) ans++;
  for (int i = 1; i <= n; i++) R[a[i]]++;
  for (int i = 1; i <= n; i++) {
    L[a[i]]++;
    R[a[i]]--;
    posval = max(posval, L[1] - L[2]);
    int sum = R[1] + R[2] + L[3] + L[1] - posval;
    ans = min(ans, sum);
  }
  cout << ans << endl;
  return 0;
}
