#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 17;
const long long INF = 2000000000000000007;
int main() {
  int k[3];
  cin >> k[0] >> k[1] >> k[2];
  vector<int> a[3];
  int b;
  for (int i = 0; i < int(3); i++)
    for (int j = 0; j < int(k[i]); j++) {
      cin >> b;
      a[i].push_back(b);
    }
  vector<long long> dp[2];
  int n = k[0] + k[1] + k[2];
  for (int i = 0; i < int(2); i++) {
    dp[i].assign(n + 1, INF);
  }
  int cnt[3][n + 1];
  for (int i = 0; i < int(3); i++)
    for (int j = 0; j < int(n + 1); j++) cnt[i][j] = 0;
  for (int i = 0; i < int(3); i++) {
    for (int j = 0; j < int(k[i]); j++) {
      int l = a[i][j];
      cnt[i][l] = 1;
    }
    for (int j = 1; j <= n; j++) {
      cnt[i][j] += cnt[i][j - 1];
    }
  }
  for (int j = 0; j < int(n + 1); j++) {
    dp[1][j] = cnt[1][n] - cnt[1][j] + cnt[2][j];
  }
  for (int i = n - 1; i >= 0; i--) {
    dp[1][i] = min(dp[1][i + 1], dp[1][i]);
  }
  long long ans = INF;
  for (int i = 0; i < int(n + 1); i++) {
    dp[0][i] = cnt[0][n] - cnt[0][i] + dp[1][i] + cnt[1][i];
    ans = min(ans, dp[0][i]);
  }
  cout << ans << endl;
  return 0;
}
