#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long k1, k2, k3;
  cin >> k1 >> k2 >> k3;
  long long arr[k1], arr1[k2], arr2[k3];
  for (long long i = 0; i < k1; i++) cin >> arr[i];
  for (long long i = 0; i < k2; i++) cin >> arr1[i];
  for (long long i = 0; i < k3; i++) cin >> arr2[i];
  long long n = k1 + k2 + k3;
  long long arr3[n];
  for (long long i = 0; i < n; i++) {
    if (i < k1)
      arr3[i] = arr[i];
    else if (i < k2 + k1)
      arr3[i] = arr1[i - k1];
    else
      arr3[i] = arr2[i - k1 - k2];
  }
  long long mark[n + 1];
  for (long long i = 0; i < k1; i++) mark[arr[i]] = 0;
  for (long long i = 0; i < k2; i++) mark[arr1[i]] = 1;
  for (long long i = 0; i < k3; i++) mark[arr2[i]] = 2;
  long long dp[n + 1][3];
  for (long long i = 0; i < n + 1; i++)
    for (long long j = 0; j < 3; j++) dp[i][j] = 1000000000;
  dp[0][0] = 0;
  dp[0][1] = 0;
  dp[0][2] = 0;
  for (long long i = 1; i <= n; i++) {
    dp[i][0] = min(dp[i - 1][0] + (mark[i] != 0), dp[i][0]);
    dp[i][1] = min({dp[i - 1][0] + (mark[i] != 1),
                    dp[i - 1][1] + (mark[i] != 1), dp[i][1]});
    dp[i][2] = min({min(dp[i - 1][1], dp[i - 1][0]) + (mark[i] != 2),
                    dp[i - 1][2] + (mark[i] != 2), dp[i][2]});
  }
  cout << min({dp[n][0], dp[n][1], dp[n][2]});
  return 0;
}
