#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, num[4], f[N], e[N], a[N];
void lis() {
  int m = 0;
  for (int i = 1; i <= n; i++) {
    f[i] = lower_bound(e + 1, e + m + 1, a[i]) - e;
    if (f[i] > m) m++;
    e[f[i]] = a[i];
  }
  cout << n - m << '\n';
}
int main() {
  for (int i = 1; i <= 3; i++) cin >> num[i];
  for (int i = 1; i <= 3; i++) {
    int k = num[i];
    vector<int> cur;
    cur.resize(k);
    for (auto& x : cur) cin >> x;
    sort(cur.begin(), cur.end());
    for (auto& x : cur) {
      n++;
      a[n] = x;
    }
  }
  lis();
}
