#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 5;
int k[4];
int a[4][maxn];
int c[maxn];
int d[maxn];
int main(void) {
  scanf("%d%d%d", &k[1], &k[2], &k[3]);
  for (int i = 1; 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);
  }
  int n = k[1] + k[2] + k[3];
  for (int i = 0; i <= n + 1; i++) {
    int pos1 = k[1] - (lower_bound(a[1] + 1, a[1] + k[1] + 1, i) - a[1]) + 1;
    int pos21 = lower_bound(a[2] + 1, a[2] + k[2] + 1, i) - a[2] - 1;
    int pos22 = k[2] - (lower_bound(a[2] + 1, a[2] + k[2] + 1, i) - a[2]) + 1;
    int pos3 = lower_bound(a[3] + 1, a[3] + k[3] + 1, i) - a[3] - 1;
    c[i] = pos1 + pos21;
    d[i] = pos22 + pos3;
  }
  for (int i = 1; i <= n + 1; i++) {
    c[i] = min(c[i], c[i - 1]);
  }
  for (int i = n; i >= 0; i--) {
    d[i] = min(d[i], d[i + 1]);
  }
  int res = INT_MAX;
  for (int i = 0; i <= n + 1; i++) {
    res = min(res, c[i] + d[i]);
  }
  printf("%d\n", res);
  return 0;
}
