#include <bits/stdc++.h>
inline long long sbt(long long x) { return __builtin_popcount(x); }
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
long long a[200013], dp[3][200013], x, k1, k2, k3, n;
int32_t main() {
  cin.sync_with_stdio(false);
  cout.sync_with_stdio(false);
  cin >> k1 >> k2 >> k3;
  for (long long i = 0; i < k1; i++) {
    cin >> x;
    x--;
    a[x] = 1;
  }
  for (long long i = 0; i < k2; i++) {
    cin >> x;
    x--;
    a[x] = 2;
  }
  for (long long i = 0; i < k3; i++) {
    cin >> x;
    x--;
    a[x] = 3;
  }
  n = k1 + k2 + k3;
  dp[0][0] = (a[0] != 1);
  for (long long i = 1; i < n; i++) {
    dp[0][i] = dp[0][i - 1] + (a[i] != 1);
  }
  dp[1][0] = (a[0] != 2);
  for (long long i = 1; i < n; i++) {
    dp[1][i] = min(dp[0][i - 1], dp[1][i - 1]) + (a[i] != 2);
  }
  dp[2][0] = (a[0] != 3);
  for (long long i = 1; i < n; i++) {
    dp[2][i] = min({dp[0][i - 1], dp[1][i - 1], dp[2][i - 1]}) + (a[i] != 3);
  }
  cout << min({dp[0][n - 1], dp[1][n - 1], dp[2][n - 1]}) << endl;
  return 0;
}
