#include <bits/stdc++.h>
using namespace std;
long long inf = 1e18;
const long long N = 5e5 + 5;
long long mod = 1e9 + 7;
long long dp[N][5];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tt = 1;
  while (tt--) {
    long long k1, k2, k3;
    cin >> k1 >> k2 >> k3;
    long long n = k1 + k2 + k3;
    vector<long long> v(n + 5, 0);
    long long x;
    for (long long i = 0; i < k1; i++) {
      cin >> x;
      v[x] = 0;
    }
    for (long long i = 0; i < k2; i++) {
      cin >> x;
      v[x] = 1;
    }
    for (long long i = 0; i < k3; i++) {
      cin >> x;
      v[x] = 2;
    }
    for (long long i = 1; i < n + 1; i++) {
      if (v[i] == 0) {
        dp[i][0] = dp[i - 1][0];
      } else {
        dp[i][0] = 1 + dp[i - 1][0];
      }
      if (v[i] == 1) {
        dp[i][1] = min(dp[i - 1][1], dp[i - 1][0]);
      } else {
        dp[i][1] = 1 + min(dp[i - 1][1], dp[i - 1][0]);
      }
      if (v[i] == 2) {
        dp[i][2] = min({dp[i - 1][0], dp[i - 1][1], dp[i - 1][2]});
      } else {
        dp[i][2] = 1 + min({dp[i - 1][0], dp[i - 1][1], dp[i - 1][2]});
      }
    }
    cout << min({dp[n][0], dp[n][1], dp[n][2]}) << '\n';
  }
  return 0;
}
