#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 7;
int K[3];
int trie[maxN], a[3][maxN], s[maxN];
int N = 0;
inline void update(int x, int val) {
  while (x < maxN) {
    trie[x] = max(trie[x], val);
    x += (x & (-x));
  }
}
inline int query(int x) {
  int sum = 0;
  while (x) {
    sum = max(sum, trie[x]);
    x -= (x & (-x));
  }
  return sum;
}
inline void init() {
  for (int i = 1; i <= N; i++) trie[i] = 0;
}
int main() {
  scanf("%d%d%d", &K[0], &K[1], &K[2]);
  for (int i = 0; i < 3; i++) {
    for (int j = 1; j <= K[i]; j++) {
      scanf("%d", &a[i][j]);
    }
    sort(a[i] + 1, a[i] + K[i] + 1);
    for (int j = 1; j <= K[i]; j++) s[++N] = a[i][j];
  }
  init();
  int ans = 0;
  for (int i = 1, tmp; i <= N; i++) {
    tmp = query(s[i]);
    tmp++;
    ans = max(ans, tmp);
    update(s[i], tmp);
  }
  printf("%d\n", N - ans);
  return 0;
}
