#include <bits/stdc++.h>
using namespace std;
long long ar[200010], n;
long long dp[200010][4];
long long ans(long long i, long long c) {
  if (i == n + 1) {
    return dp[i][c] = 0;
  }
  if (dp[i][c] != -1) {
    return dp[i][c];
  }
  long long tans = LLONG_MAX;
  for (int j = c; j <= 3; j++) {
    tans = min(tans, (!(ar[i] == j)) + ans(i + 1, j));
  }
  return dp[i][c] = tans;
}
int main() {
  cin.sync_with_stdio(false);
  cout.sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  t = 1;
  while (t--) {
    memset(dp, -1, sizeof(dp));
    long long k1, k2, k3, a;
    cin >> k1 >> k2 >> k3;
    n = k1 + k2 + k3;
    memset(ar, 0, sizeof(ar));
    for (long i = 0; i < k1; i++) {
      cin >> a;
      ar[a] = 1;
    }
    for (long i = 0; i < k2; i++) {
      cin >> a;
      ar[a] = 2;
    }
    for (long i = 0; i < k3; i++) {
      cin >> a;
      ar[a] = 3;
    }
    cout << ans(1, 1);
  }
  return 0;
}
