#include <bits/stdc++.h>
using namespace std;
int num[200005];
int lis[200005];
int main() {
  int n1, n2, n3;
  cin >> n1 >> n2 >> n3;
  for (int i = 1; i <= n1 + n2 + n3; i++) {
    cin >> num[i];
  }
  sort(num + 1, num + 1 + n1);
  sort(num + 1 + n1, num + 1 + n1 + n2);
  sort(num + 1 + n1 + n2, num + 1 + n1 + n2 + n3);
  int st = 1, et = 1;
  lis[1] = num[1];
  for (int i = 2; i <= n1 + n2 + n3; i++) {
    int l = st, r = et;
    if (num[i] >= lis[et]) {
      et++;
      lis[et] = num[i];
      continue;
    }
    while (l < r) {
      int mid = (l + r) >> 1;
      if (lis[mid] < num[i]) {
        l = mid + 1;
      } else {
        r = mid;
      }
    }
    lis[l] = num[i];
  }
  cout << n1 + n2 + n3 - et << endl;
  return 0;
}
