#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
int main() {
  cin.tie(0), ios::sync_with_stdio(0);
  int k[3];
  cin >> k[0] >> k[1] >> k[2];
  vector<int> a[3];
  for (int i = 0; i < 3; i++) {
    a[i].resize(k[i]);
    for (int j = 0; j < k[i]; j++) cin >> a[i][j];
    sort(a[i].begin(), a[i].end());
  }
  int n = k[0] + k[1] + k[2];
  vector<int> pre(n + 1), suf(n + 1);
  for (int i = 1, j = 0, p = 0, c = pre[0] = k[0]; i <= n; i++) {
    if (j < k[0] && i == a[0][j])
      c--, j++;
    else if (p < k[1] && i == a[1][p])
      c++, p++;
    pre[i] = c;
  }
  for (int i = 1, j = k[2] - 1, p = k[1] - 1, c = suf[0] = k[2]; i <= n; i++) {
    if (j >= 0 && (n - i + 1) == a[2][j])
      c--, j--;
    else if (p >= 0 && (n - i + 1) == a[1][p])
      c++, p--;
    suf[i] = c;
  }
  int ans = n;
  for (int i = n, mn = 1e9; i >= 0; i--)
    ans = min(ans, pre[i] + (mn = min(mn, suf[n - i])));
  cout << ans << "\n";
  return 0;
}
