#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int pos[N];
int cntR[5];
int cntL[5];
int main() {
  int a, b, c;
  scanf("%d %d %d", &a, &b, &c);
  int n = a + b + c;
  for (int i = 1; i <= a; i++) {
    int x;
    scanf("%d", &x);
    pos[x] = 1;
  }
  for (int i = 1; i <= b; i++) {
    int x;
    scanf("%d", &x);
    pos[x] = 2;
  }
  for (int i = 1; i <= c; i++) {
    int x;
    scanf("%d", &x);
    pos[x] = 3;
  }
  for (int i = 1; i <= n; i++) {
    cntR[pos[i]]++;
  }
  int ans = cntR[1] + cntR[2];
  int ma = 0;
  for (int i = 1; i <= n; i++) {
    cntL[pos[i]]++;
    cntR[pos[i]]--;
    ma = max(ma, cntL[1] - cntL[2]);
    int tmp = cntR[1] + cntR[2] + cntL[3] + cntL[1] - ma;
    ans = min(ans, tmp);
  }
  printf("%d\n", ans);
  return 0;
}
