#include <bits/stdc++.h>
clock_t time_p = clock();
using namespace std;
const int N = 2e5 + 1, mod = 998244353;
int sgt[4 * N];
void update(int l, int r, int id, int val, int i) {
  if (l > id || r < id) return;
  if (l == r) {
    sgt[i] = val;
    return;
  }
  int m = (l + r) / 2;
  update(l, m, id, val, 2 * i);
  update(m + 1, r, id, val, 2 * i + 1);
  sgt[i] = max(sgt[2 * i], sgt[2 * i + 1]);
}
int get(int l, int r, int a, int b, int i) {
  if (l > b || r < a) return 0;
  if (l >= a && r <= b) {
    return sgt[i];
  }
  int m = (l + r) / 2;
  return max(get(l, m, a, b, 2 * i), get(m + 1, r, a, b, 2 * i + 1));
}
int lis(vector<int> &v) {
  int n = v.size(), res = 1;
  update(1, n, v[0], 1, 1);
  for (int i = 1; i < n; i++) {
    int temp = get(1, n, 1, v[i] - 1, 1);
    res = max(res, temp + 1);
    update(1, n, v[i], temp + 1, 1);
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int tc = 1;
  while (tc--) {
    int a, b, c, x;
    cin >> a >> b >> c;
    vector<int> v1, v2, v3;
    for (int i = 0; i < a; i++) {
      cin >> x;
      v1.push_back(x);
    }
    for (int i = 0; i < b; i++) {
      cin >> x;
      v2.push_back(x);
    }
    for (int i = 0; i < c; i++) {
      cin >> x;
      v3.push_back(x);
    }
    sort(v1.begin(), v1.end());
    sort(v2.begin(), v2.end());
    sort(v3.begin(), v3.end());
    vector<int> meh;
    for (int i = 0; i < a; i++) meh.push_back(v1[i]);
    ;
    for (int i = 0; i < b; i++) meh.push_back(v2[i]);
    ;
    for (int i = 0; i < c; i++) meh.push_back(v3[i]);
    ;
    cout << a + b + c - lis(meh) << "\n";
  }
  cerr << "\nTime Taken : " << (float)(clock() - time_p) / CLOCKS_PER_SEC
       << "\n";
  ;
}
