#include <bits/stdc++.h>
using namespace std;
set<long long> s1, s2, s3;
long long dp[4][200010];
signed main() {
  long long k1, k2, k3, x;
  cin >> k1 >> k2 >> k3;
  long long n = k1 + k2 + k3;
  for (long long i = 0; i < k1; i++) {
    cin >> x;
    s1.insert(x);
  }
  for (long long i = 0; i < k2; i++) {
    cin >> x;
    s2.insert(x);
  }
  for (long long i = 0; i < k3; i++) {
    cin >> x;
    s3.insert(x);
  }
  for (long long i = 1; i <= n; i++) {
    dp[1][i] = dp[1][i - 1] + (!s1.count(i));
    dp[2][i] = min(dp[1][i - 1], dp[2][i - 1]) + (!s2.count(i));
    dp[3][i] = min({dp[1][i - 1], dp[2][i - 1], dp[3][i - 1]}) + (!s3.count(i));
  }
  cout << min({dp[1][n], dp[2][n], dp[3][n]}) << endl;
}
