#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    long long int k1, k2, k3;
    cin >> k1 >> k2 >> k3;
    vector<long long int> v1(k1), v2(k2), v3(k3);
    for (long long int i = 0; i < k1; i++) cin >> v1[i];
    for (long long int i = 0; i < k2; i++) cin >> v2[i];
    for (long long int i = 0; i < k3; i++) cin >> v3[i];
    sort(v1.begin(), v1.end());
    sort(v2.begin(), v2.end());
    sort(v3.begin(), v3.end());
    vector<long long int> v;
    for (long long int i = 0; i < k1; i++) v.push_back(v1[i]);
    for (long long int i = 0; i < k2; i++) v.push_back(v2[i]);
    for (long long int i = 0; i < k3; i++) v.push_back(v3[i]);
    long long int ans = k1 + k2 + k3;
    const long long int inf = 1e18;
    vector<long long int> dp((long long int)v.size() + 1, inf);
    dp[0] = -inf;
    long long int ans1 = 0;
    for (long long int i = 0; i < v.size(); i++) {
      long long int pos = upper_bound(dp.begin(), dp.end(), v[i]) - dp.begin();
      if (dp[pos - 1] < v[i] && v[i] < dp[pos]) dp[pos] = v[i];
    }
    for (long long int i = 0; i <= (long long int)v.size(); i++) {
      if (dp[i] < inf) ans1 = i;
    }
    cout << ans - ans1 << endl;
  }
  return 0;
}
