#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;
    int X, Y, Z;
    cin>>X;
    vector<int> x(X);
    for(int i=0; i<X; i++) cin>>x[i];
    cin>>Y;
    vector<int> y(Y);
    for(int i=0; i<Y; i++) cin>>y[i];
    cin>>Z;
    vector<int> z(Z);
    for(int i=0; i<Z; i++) cin>>z[i];

    set<int> s;

    for(int i=0; i<Z; i++){
        s.insert(z[i]);
    }

    for(int i=0; i<X; i++){
        s.erase(x[i]);
    }

    for(int i=0; i<Y; i++){
        for(int j=0; j<Z; j++){
            if(y[i] == z[j]){
                s.insert(y[i]);
                break;
            }
        }
    }

    cout << s.size() << endl;
}
