#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n;
int k[3], a[3][N], f[N][3], bel[N];
int main() {
  for (int i = 0; i < 3; ++i) cin >> k[i];
  for (int i = 0; i < 3; ++i) {
    n += k[i];
    for (int j = 1; j <= k[i]; ++j) {
      cin >> a[i][j];
      bel[a[i][j]] = i;
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < 3; ++j) {
      f[i][j] = f[i - 1][j] + (bel[i] == j);
      if (j) f[i][j] = max(f[i][j], f[i - 1][j - 1] + (bel[i] == j));
      if (j > 1) f[i][j] = max(f[i][j], f[i - 1][j - 2] + (bel[i] == j));
    }
  }
  cout << n - *max_element(f[n], f[n] + 3) << endl;
}
