#include <bits/stdc++.h>
using namespace std;
int const N = 2e5 + 10;
vector<int> res;
int a[N], n2, n1, n3, n, sumup, sumdown, f[N];
int main() {
  std::ios::sync_with_stdio(false);
  cin >> n1 >> n2 >> n3;
  for (int i = 1; i <= n1 + n2 + n3; i++) cin >> a[i];
  sort(a + 1, a + n1 + 1);
  sort(a + n1 + 1, a + n1 + n2 + 1);
  sort(a + n1 + n2 + 1, a + n1 + n2 + n3 + 1);
  for (int i = 1; i <= n1 + n2 + n3; i++) {
    if (res.empty() || res.back() < a[i])
      res.push_back(a[i]);
    else {
      int pos = lower_bound(res.begin(), res.end(), a[i]) - res.begin();
      res[pos] = a[i];
    }
  }
  cout << n1 + n2 + n3 - res.size();
  return 0;
}
