#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, N = 1e5 + 10;
void solve() {
  long long n1, n2, n3;
  cin >> n1 >> n2 >> n3;
  long long x;
  long long n = n1 + n2 + n3;
  long long ch[n + 1];
  for (int i = 0; i < n1; i++) {
    cin >> x;
    ch[x] = 0;
  }
  for (int i = 0; i < n2; i++) {
    cin >> x;
    ch[x] = 1;
  }
  for (int i = 0; i < n3; i++) {
    cin >> x;
    ch[x] = 2;
  }
  long long dp[n + 1][3];
  for (int j = 0; j < 3; j++) dp[0][j] = 0;
  for (int i = 1; i <= n; i++) {
    dp[i][0] = dp[i - 1][0] + 1;
    dp[i][1] = min(dp[i - 1][0], dp[i - 1][1]) + 1;
    dp[i][2] = min({dp[i - 1][2], dp[i - 1][1], dp[i - 1][0]}) + 1;
    dp[i][ch[i]]--;
  }
  cout << min({dp[n][2], dp[n][1], dp[n][0]});
  return;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int test = 1;
  while (test--) {
    solve();
  }
}
