#include <bits/stdc++.h>
using namespace std;
void solve() {
  int k1, k2, k3;
  cin >> k1 >> k2 >> k3;
  int n = k1 + k2 + k3;
  vector<int> P(n + 1);
  for (int i = 0; i < k1; i++) {
    int a;
    cin >> a;
    P[a] = 0;
  }
  for (int i = 0; i < k2; i++) {
    int a;
    cin >> a;
    P[a] = 1;
  }
  for (int i = 0; i < k3; i++) {
    int a;
    cin >> a;
    P[a] = 2;
  }
  vector<int> A(n + 1), B(n + 1), C(n + 1);
  for (int i = 1; i <= n; i++) {
    A[i] = A[i - 1] + (P[i] == 0);
    B[i] = B[i - 1] + (P[i] == 1);
    C[i] = C[i - 1] + (P[i] == 2);
  }
  vector<int> X(n + 1, 0), Y(n + 1, 0);
  for (int i = 1; i <= n; i++) {
    X[i] = B[i] - A[i];
    Y[i] = C[i] - B[i];
  }
  vector<int> mY(n + 2, n);
  for (int i = n; i >= 0; i--) mY[i] = min(mY[i + 1], Y[i]);
  int ans = n;
  for (int i = 0; i <= n; i++) {
    ans = min(ans, k1 + k2 + X[i] + mY[i]);
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve();
}
