#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
const int inf = 0x3f3f3f3f;
int k1, k2, k3, n, x;
int a[maxn], dp[maxn][5];
int main() {
  scanf("%d%d%d", &k1, &k2, &k3);
  n = k1 + k2 + k3;
  for (int i = 1; i <= n; i++) {
    dp[i][1] = dp[i][2] = dp[i][3] = inf;
    scanf("%d", &x);
    if (i <= k1)
      a[x] = 1;
    else if (i <= k1 + k2)
      a[x] = 2;
    else
      a[x] = 3;
  }
  for (int i = 1; i <= n; i++) {
    dp[i][1] = dp[i - 1][1] + (a[i] != 1);
    dp[i][2] = min(dp[i - 1][1], dp[i - 1][2]) + (a[i] != 2);
    dp[i][3] = min(dp[i - 1][1], min(dp[i - 1][2], dp[i - 1][3])) + (a[i] != 3);
  }
  cout << min(dp[n][1], min(dp[n][2], dp[n][3])) << '\n';
  return 0;
}
