#include <bits/stdc++.h>
using namespace std;
void partition(vector<int>& p1, vector<int>& p2, int n, vector<int>& dp) {
  sort(p1.begin(), p1.end());
  sort(p2.begin(), p2.end());
  int ans = n;
  int ind = 0;
  for (int i = 0; i <= n + 1; i++) {
    auto x = lower_bound(p1.begin(), p1.end(), i);
    int cnt1 = (p1.end() - x);
    int cnt2 = (lower_bound(p2.begin(), p2.end(), i) - p2.begin());
    if (ans > cnt1 + cnt2) {
      ans = cnt1 + cnt2;
      ind = i;
    }
    dp[i] = ans;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int k[3];
  int n = 0;
  vector<vector<int> > a(3);
  for (int i = 0; i < 3; i++) cin >> k[i], n += k[i], a[i].resize(k[i]);
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < k[i]; j++) cin >> a[i][j];
  }
  vector<int> p1, p2;
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < k[i]; j++) p1.push_back(a[i][j]);
  for (int j = 0; j < k[2]; j++) p2.push_back(a[2][j]);
  vector<vector<int> > dp(2, vector<int>(n + 2));
  partition(p1, p2, n, dp[0]);
  partition(a[0], a[1], n, dp[1]);
  int ans = n;
  vector<int> mn(n + 3);
  mn[1] = dp[1][0];
  for (int i = 2; i <= n + 2; i++) {
    mn[i] = min(mn[i - 1], dp[1][i - 1]);
  }
  for (int i = 0; i <= n + 1; i++) {
    int temp = mn[i + 1] + dp[0][i];
    temp -= a[0].end() - upper_bound(a[0].begin(), a[0].end(), i);
    ans = min(ans, temp);
  }
  cout << ans << endl;
  return 0;
}
