#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int dp[4][maxn];
int a[maxn];
int vis[maxn];
int main() {
  int k1, k2, k3;
  cin >> k1 >> k2 >> k3;
  int n = k1 + k2 + k3;
  int now = 1;
  int x;
  for (int i = 1; i <= k1; i++) {
    scanf("%d", &x);
    vis[x] = 1;
    now++;
  }
  for (int i = 1; i <= k2; i++) {
    scanf("%d", &x);
    vis[x] = 2;
    now++;
  }
  for (int i = 1; i <= k3; i++) {
    scanf("%d", &x);
    vis[x] = 3;
    now++;
  }
  for (int i = 1; i <= n; i++) {
    dp[1][i] = dp[1][i - 1] + (vis[i] == 1 ? 0 : 1);
    dp[2][i] = min(dp[2][i - 1], dp[1][i - 1]) + (vis[i] == 2 ? 0 : 1);
    dp[3][i] = min(dp[1][i - 1], min(dp[2][i - 1], dp[3][i - 1])) +
               (vis[i] == 3 ? 0 : 1);
  }
  cout << min(dp[1][n], min(dp[2][n], dp[3][n])) << endl;
}
