#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
#define chmin(a, b) ((a) = min((a), (b)))
#define chmax(a, b) ((a) = max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;

const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1);
const double eps = 1e-10;

int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};

int main(){
    int n; cin>>n;
    vector<bool> a(n, false), b(n, false), c(n, false);
    int x; cin>>x;
    for(int i=0; i<x; i++){
        int d; cin>>d;
        a[--d] = true;
    }
    int y; cin>>y;
    for(int i=0; i<y; i++){
        int d; cin>>d;
        b[--d] = true;
    }
    int z; cin>>z;
    for(int i=0; i<z; i++){
        int d; cin>>d;
        c[--d] = true;
    }

    int ans = 0;
    for(int i=0; i<n; i++){
        if((!a[i] && c[i]) || (b[i] && c[i])){
            ans++;
        }
    }

    cout << ans << endl;
}
