#include <bits/stdc++.h>
using namespace std;
int k1, k2, k3, n;
int a1[200007], a2[200007], a3[200007];
int dp1[200007], dp2[200007];
int boro(int x, int *a, int y) {
  int b = 0, e = y - 1, ans = y;
  while (b <= e) {
    int mid = (b + e) >> 1;
    if (b >= e) {
      if (a[mid] > x) ans = mid;
      return ans;
    }
    if (a[mid] > x) {
      ans = mid;
      e = mid;
    } else
      b = mid + 1;
  }
}
int choto(int x, int *a, int y) {
  int b = 0, e = y - 1, ans = -1;
  while (b <= e) {
    int mid = (b + e) >> 1;
    if (b >= e) {
      if (a[mid] < x) ans = mid;
      return ans;
    }
    if (a[mid] < x) {
      ans = mid;
      b = mid + 1;
    } else
      e = mid;
  }
}
int main() {
  scanf("%d%d%d", &k1, &k2, &k3);
  for (int i = 0; i < k1; i++) {
    scanf("%d", &a1[i]);
  }
  for (int i = 0; i < k2; i++) {
    scanf("%d", &a2[i]);
  }
  for (int i = 0; i < k3; i++) {
    scanf("%d", &a3[i]);
  }
  sort(a1, a1 + k1);
  sort(a2, a2 + k2);
  sort(a3, a3 + k3);
  n = k1 + k2 + k3;
  int minn = 2 * n;
  for (int i = 0; i <= n; i++) {
    dp1[i] = (k1 - boro(i, a1, k1)) + (choto(i, a2, k2) - 0 + 1);
    if (i >= 1) dp1[i] = min(dp1[i], dp1[i - 1]);
  }
  for (int i = n + 1; i >= 1; i--) {
    dp2[i] = (k2 - boro(i, a2, k2)) + (choto(i, a3, k3) - 0 + 1) + dp1[i - 1];
    minn = min(minn, dp2[i]);
  }
  printf("%d\n", minn);
  return 0;
}
