#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
int a[200005];
int dp[200005];
int main() {
  int k1, k2, k3, x, n;
  cin >> k1 >> k2 >> k3;
  n = k1 + k2 + k3;
  for (int i = 1; i <= k1; i++) {
    scanf("%d", &x);
    a[x] = 0;
  }
  for (int i = 1; i <= k2; i++) {
    scanf("%d", &x);
    a[x] = 1;
  }
  for (int i = 1; i <= k3; i++) {
    scanf("%d", &x);
    a[x] = 2;
  }
  int top = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] >= dp[top])
      dp[++top] = a[i];
    else {
      int l = 1, r = top;
      while (r >= l) {
        int mid = (l + r) / 2;
        if (dp[mid] > a[i])
          r = mid - 1;
        else
          l = mid + 1;
      }
      dp[r + 1] = a[i];
    }
  }
  printf("%d\n", n - top);
}
