#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5, MOD = 1e9 + 7;
void solve() {
  long long k1, k2, k3;
  cin >> k1 >> k2 >> k3;
  long long n = k1 + k2 + k3;
  vector<long long> p(n + 1);
  for (long long i = 0; i < k1; i++) {
    long long x;
    cin >> x;
    p[x] = 1;
  }
  for (long long i = 0; i < k2; i++) {
    long long x;
    cin >> x;
    p[x] = 2;
  }
  for (long long i = 0; i < k3; i++) {
    long long x;
    cin >> x;
    p[x] = 3;
  }
  vector<vector<long long>> dp(4, vector<long long>(n + 1, -1));
  for (long long i = 0; i < 4; i++) {
    for (long long j = 0; j <= n; j++) {
      if (j == 0)
        dp[i][j] = 0;
      else if (i == 0) {
        dp[i][j] = MOD;
      } else {
        long long x = 0;
        if (p[j] != i) x = 1;
        dp[i][j] = min(dp[i - 1][j], dp[i][j - 1] + x);
      }
    }
  }
  cout << dp[3][n] << "\n";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
