#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
int n, k1, k2, k3;
const int INF = 1e9 + 7;
void solve() {
  cin >> k1 >> k2 >> k3;
  n = k1 + k2 + k3;
  vector<int> a(k1), b(k2), c(k3), g;
  for (int i = 0; i < k1; ++i) cin >> a[i];
  for (int i = 0; i < k2; ++i) cin >> b[i];
  for (int i = 0; i < k3; ++i) cin >> c[i];
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  sort(c.begin(), c.end());
  g = a;
  for (auto d : b) g.push_back(d);
  for (auto d : c) g.push_back(d);
  vector<int> dp(n + 1, INF);
  dp[0] = -INF;
  int ans = 0;
  for (auto d : g) {
    int j = lower_bound(dp.begin(), dp.end(), d) - dp.begin();
    if (dp[j - 1] < d && d < dp[j]) {
      ans = max(ans, j);
      dp[j] = d;
    }
  }
  cout << n - ans;
}
