#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
const int inf = 1e9;
int sp[4][MAXN];
vector<pair<int, int> > ord;
vector<pair<int, int> > aux;
int main() {
  int a, b, c;
  cin >> a >> b >> c;
  int n = a + b + c;
  int nr;
  for (int i = 1; i <= a; i++) {
    cin >> nr;
    sp[1][nr] = 1;
  }
  for (int i = 1; i <= b; i++) {
    cin >> nr;
    sp[2][nr] = 1;
  }
  for (int i = 1; i <= c; i++) {
    cin >> nr;
    sp[3][nr] = 1;
  }
  for (int i = 1; i <= 3; i++) {
    for (int j = 1; j <= n; j++) {
      sp[i][j] += sp[i][j - 1];
    }
  }
  for (int i = 1; i <= 3; i++) {
    for (int j = 1; j <= n; j++) {
      sp[i][j] = j - sp[i][j];
    }
  }
  for (int i = 0; i <= n; i++) {
    ord.push_back({sp[3][n] - sp[3][i] + sp[2][i], i});
  }
  sort(ord.begin(), ord.end());
  int MIN = 0;
  for (auto &x : ord) {
    if (x.second > MIN) {
      MIN = x.second;
      aux.push_back(x);
    }
  }
  int pnt = 0;
  int ans = inf;
  for (int i = 0; i <= n; i++) {
    while (ord[pnt].second < i) {
      pnt++;
    }
    ans = min(ans, ord[pnt].first - sp[2][i] + sp[1][i]);
  }
  cout << ans;
  return 0;
}
