#include <bits/stdc++.h>
using namespace std;
long long ans, n;
set<long long> s1, s2, s3;
long long dp[1000000][5];
long long func(long long i, long long type) {
  if (i == n + 1) return 0;
  if (dp[i][type] != -1) return dp[i][type];
  long long q1 = 9e18, q2 = 9e18, q3 = 9e18;
  long long player;
  if (s1.find(i) != s1.end())
    player = 1;
  else if (s2.find(i) != s2.end())
    player = 2;
  else
    player = 3;
  if (type == 1) {
    if (player != 1)
      q1 = 1;
    else
      q1 = 0;
    q1 += func(i + 1, 1);
  }
  if (type <= 2) {
    if (player != 2)
      q2 = 1;
    else
      q2 = 0;
    q2 += func(i + 1, 2);
  }
  if (type <= 3) {
    if (player != 3)
      q3 = 1;
    else
      q3 = 0;
    q3 += func(i + 1, 3);
  }
  dp[i][type] = min(q1, min(q2, q3));
  return dp[i][type];
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long k1, k2, k3;
  cin >> k1 >> k2 >> k3;
  n = k1 + k2 + k3;
  memset(dp, -1, sizeof(dp));
  for (long long i = 0; i < k1; i++) {
    long long x;
    cin >> x;
    s1.insert(x);
  }
  for (long long i = 0; i < k2; i++) {
    long long x;
    cin >> x;
    s2.insert(x);
  }
  for (long long i = 0; i < k3; i++) {
    long long x;
    cin >> x;
    s3.insert(x);
  }
  ans = min(k1 + k2, min(k2 + k3, k1 + k3));
  long long temp = func(1, 1);
  ans = min(ans, dp[1][1]);
  cout << ans << "\n";
  return 0;
}
