#include <iostream>
#include <vector>

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a_n(n);
    for(int &x : a_n) cin >> x;

    int m;
    cin >> m;
    vector<int> a_m(m);
    for(int &x : a_m) cin >> x;

    int p;
    cin >> p;
    vector<int> a_p(p);
    for(int &x : a_p) cin >> x;


    int p_n = 0;
    int p_m = 0;
    int p_p = 0;

    while(p_n < n && p_m < m && p_p < p) {
        int min = a_n[p_n];
        if(min == a_m[p_m] && min == a_p[p_p]) {
            p_n++; p_m++; p_p++;
            cout << min << endl;
            continue;
        }

        if(a_m[p_m] < min) min = a_m[p_m];
        if(a_p[p_p] < min) min = a_p[p_p];

        if(a_n[p_n] == min) p_n++;
        if(a_m[p_m] == min) p_m++;
        if(a_p[p_p] == min) p_p++;
    }
}