#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9;
const int INF = 1e9;
namespace FastIO {
inline int read() {
  int x = 0, F = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') F = ch == '-' ? -1 : 1, ch = getchar();
  while (ch >= '0' && ch <= '9')
    x = (x << 1) + (x << 3) + (ch & 15), ch = getchar();
  return x * F;
}
inline void write(int x) {
  if (x < 0) putchar('-'), x = ~x + 1;
  if (x > 9) write(x / 10);
  putchar((x % 10) | 48);
}
inline void write(int x, char ch) { write(x), putchar(ch); }
}  // namespace FastIO
using namespace FastIO;
int tot, ans = INF;
int n[3];
int f[3][N];
int mn[N];
signed main() {
  cin >> n[0] >> n[1] >> n[2];
  tot = n[0] + n[1] + n[2];
  for (int i = 0; i < 3; i++) {
    for (int j = 1; j <= n[i]; j++) f[i][read()] = 1;
    for (int j = 1; j <= tot; j++) f[i][j] += f[i][j - 1];
  }
  mn[tot + 1] = INF;
  for (int i = tot; i >= 0; i--) mn[i] = min(mn[i + 1], f[2][i] - f[1][i]);
  for (int i = 0; i <= tot; i++)
    ans = min(ans, tot - f[0][i] + f[1][i] - f[2][tot] + mn[i]);
  cout << ans << endl;
  return 0;
}
