#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 10;
void solve() {
  int n1, n2, n3;
  cin >> n1 >> n2 >> n3;
  int n = n1 + n2 + n3;
  vector<int> cnt(n);
  for (int i = 0; i < n1; i++) {
    int x;
    cin >> x;
    x--;
    cnt[x] = 0;
  }
  for (int i = 0; i < n2; i++) {
    int x;
    cin >> x;
    x--;
    cnt[x] = 1;
  }
  for (int i = 0; i < n3; i++) {
    int x;
    cin >> x;
    x--;
    cnt[x] = 2;
  }
  vector<vector<int> > dp(n + 1, vector<int>(3, inf));
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 2; j++) {
      dp[i][j + 1] = min(dp[i][j + 1], dp[i][j]);
    }
    for (int j = 0; j < 3; j++) {
      int add = (cnt[i] != j);
      dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + add);
    }
  }
  int ans = *min_element(dp[n].begin(), dp[n].end());
  cout << ans << "\n";
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  int test;
  test = 1;
  while (test--) {
    solve();
  }
  return 0;
}
