#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 200005;
int n, in[MAXN], k[3], DP[MAXN][3];
bool vis[MAXN][3];
int dp(int id, int st) {
  if (id == 0) return 0;
  if (vis[id][st]) return DP[id][st];
  vis[id][st] = 1;
  DP[id][st] = dp(id - 1, 0) + (in[id] != st);
  for (int i = 1; i <= st; ++i) {
    DP[id][st] = min(DP[id][st], dp(id - 1, i) + (in[id] != st));
  }
  return DP[id][st];
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int p;
  while (cin >> k[0] >> k[1] >> k[2]) {
    n = k[0] + k[1] + k[2];
    for (int i = 0; i < 3; ++i) {
      for (int j = 0; j < k[i]; ++j) {
        cin >> p;
        in[p] = i;
      }
    }
    memset(vis, 0, sizeof(vis));
    cout << min(dp(n, 0), min(dp(n, 1), dp(n, 2))) << '\n';
  }
  return 0;
}
