#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long __64inf = 0x3f3f3f3f3f3f3f3f;
const int MAX = 1e6 + 50;
const int mod = 1e9 + 7;
int A[MAX], a[MAX];
int dp[MAX][3];
int main() {
  int k1, k2, k3;
  scanf("%d%d%d", &k1, &k2, &k3);
  memset(dp, 0x3f, sizeof(dp));
  memset(a, -1, sizeof(a));
  int pos = 1;
  for (int i = 1; i <= k1; i++, pos++) {
    scanf("%d", &A[pos]);
    a[A[pos]] = 0;
  }
  for (int i = 1; i <= k2; i++, pos++) {
    scanf("%d", &A[pos]);
    a[A[pos]] = 1;
  }
  for (int i = 1; i <= k3; i++, pos++) {
    scanf("%d", &A[pos]);
    a[A[pos]] = 2;
  }
  memset(dp[0], 0, sizeof(dp[0]));
  for (int i = 1; i <= k1 + k2 + k3; i++) {
    dp[i][0] = dp[i - 1][0] + (a[i] == 0 ? 0 : 1);
    dp[i][1] = min(dp[i - 1][0], dp[i - 1][1]) + (a[i] == 1 ? 0 : 1);
    dp[i][2] = min(dp[i - 1][0], min(dp[i - 1][1], dp[i - 1][2])) +
               (a[i] == 2 ? 0 : 1);
  }
  int n = k1 + k2 + k3;
  printf("%d\n", *min_element(dp[k1 + k2 + k3], dp[k1 + k2 + k3] + 3));
}
