#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <stdio.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>

using namespace std;

#define Rep(i,a,b) for(int i = a; i < b; i++)
#define rep(i,b) Rep(i,0,b)
#define rrep(i,a) for(int i = a; i >= 0; i--)
#define allof(a) (a).begin(), (a).end()

typedef long long ll;
const int inf = 1e9 + 7;
const ll infll = 1ll << 60ll;
const ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };

int main() {

	int n;
	cin >> n;
	int x, y, z;
	cin >> x;
	vector<int>a(x);
	rep(i, x) cin >> a[i];
	cin >> y;
	vector<int>b(y);
	rep(i, y) cin >> b[i];
	cin >> z;
	vector<int>c(z);
	rep(i, z) cin >> c[i];

	vector<vector<bool>>user(n, vector<bool>(3, false));

	rep(i, x) {
		user[a[i] - 1][0] = true;
	}
	rep(i, y) {
		user[b[i] - 1][1] = true;
 	}
	rep(i, z) {
		user[c[i] - 1][2] = true;
	}

	vector<bool> ok(n, false);
	rep(i, n) {
		if ((!user[i][0] && user[i][2]) || (user[i][1] && user[i][2]))
			ok[i] = true;
	}

	int ans = 0;
	rep(i, n) {
		if (ok[i]) ans++;
	}

	cout << ans << endl;

	return 0;
}

