#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
const int oo = 1e9 + 7;
inline void initf() {
  freopen(
      "E"
      ".inp",
      "r", stdin);
  freopen(
      "E"
      ".out",
      "w", stdout);
}
int n, n1, n2, n3;
vector<int> a, b, c;
void enter() {
  cin >> n1 >> n2 >> n3;
  a.resize(n1);
  b.resize(n2);
  c.resize(n3);
  for (int &x : a) cin >> x;
  sort(a.begin(), a.end());
  for (int &x : b) cin >> x;
  sort(b.begin(), b.end());
  for (int &x : c) cin >> x;
  sort(c.begin(), c.end());
}
int LIS() {
  vector<int> d(n + 1, oo);
  d[0] = 0;
  int res = 0;
  for (int x : a) {
    int k = lower_bound(d.begin(), d.end(), x) - d.begin();
    d[k] = x;
    res = max(res, k);
  }
  return res;
}
void solve() {
  n = n1 + n2 + n3;
  for (int x : b) a.push_back(x);
  for (int x : c) a.push_back(x);
  cout << n - LIS();
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  enter();
  solve();
  return 0;
}
