#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int MAX = 2e5 + 5;
const int MOD = 1e9 + 7;
const int64_t INF = INT_MAX;
const int64_t _INF = INT_MIN;
int n;
int p[MAX], mn[4][MAX];
void build(int k1, int k2, int k3) {
  int temp;
  while (k1--) {
    cin >> temp;
    p[temp] = 1;
  }
  while (k2--) {
    cin >> temp;
    p[temp] = 2;
  }
  while (k3--) {
    cin >> temp;
    p[temp] = 3;
  }
}
int solve() {
  int ans;
  for (int i = 1; i <= n; i++) mn[1][i] = mn[1][i - 1] + (p[i] != 1);
  for (int i = 1; i <= n; i++)
    mn[2][i] = min(mn[1][i], min(mn[1][i - 1], mn[2][i - 1]) + (p[i] != 2));
  ans = mn[2][n];
  for (int i = n; i >= 1; i--) {
    mn[3][i] = mn[3][i + 1] + (p[i] != 3);
    ans = min(ans, mn[2][i - 1] + mn[3][i]);
  }
  return ans;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int k1, k2, k3;
  cin >> k1 >> k2 >> k3;
  build(k1, k2, k3);
  n = k1 + k2 + k3;
  cout << solve();
}
