#include <bits/stdc++.h>
using namespace std;
int k1, k2, k3;
int a[210000], f[210000][4];
int main() {
  scanf("%d%d%d", &k1, &k2, &k3);
  for (int i = 1; i <= k1; i++) {
    int u;
    scanf("%d", &u);
    a[u] = 1;
  }
  for (int i = 1; i <= k2; i++) {
    int u;
    scanf("%d", &u);
    a[u] = 2;
  }
  for (int i = 1; i <= k3; i++) {
    int u;
    scanf("%d", &u);
    a[u] = 3;
  }
  int n = k1 + k2 + k3;
  f[n + 1][1] = f[n + 1][2] = f[n + 1][3] = 0;
  for (int i = n; i >= 1; i--)
    for (int j = 3; j >= 1; j--) {
      int tmp = (a[i] == j) ? 0 : 1;
      f[i][j] = f[i + 1][j] + tmp;
      if (j < 3) f[i][j] = min(f[i][j + 1], f[i][j]);
    }
  printf("%d\n", f[1][1]);
  return 0;
}
