#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int a1[maxn], a2[maxn], a3[maxn];
int p[maxn], tmp[maxn];
int n;
int LIS() {
  int pt = 0;
  for (int i = 1; i <= n; ++i) {
    if (!pt || tmp[pt] < p[i]) {
      tmp[++pt] = p[i];
    } else {
      int j = lower_bound(tmp + 1, tmp + 1 + pt, p[i]) - tmp;
      tmp[j] = p[i];
    }
  }
  return pt;
}
int main() {
  int k1, k2, k3;
  scanf("%d%d%d", &k1, &k2, &k3);
  for (int i = 1; i <= k1; ++i) scanf("%d", &a1[i]);
  for (int i = 1; i <= k2; ++i) scanf("%d", &a2[i]);
  for (int i = 1; i <= k3; ++i) scanf("%d", &a3[i]);
  sort(a1 + 1, a1 + 1 + k1);
  sort(a2 + 1, a2 + 1 + k2);
  sort(a3 + 1, a3 + 1 + k3);
  for (int i = 1; i <= k1; ++i) p[++n] = a1[i];
  for (int i = 1; i <= k2; ++i) p[++n] = a2[i];
  for (int i = 1; i <= k3; ++i) p[++n] = a3[i];
  printf("%d\n", n - LIS());
  return 0;
}
