void solve() {
    vector<pair<int,int>> a;
    const int total_set = 4;
    for(int i=0;i<total_set;++i) {
        int n; cin>>n;
        for(int j=0;j<n;++j) {
            int x; cin>>x;
            a.emplace_back(x, i+1);
        }
    }
    int n = (int) a.size();
    sort(a.begin(), a.end());
    map<int, int> sets;
    int min_distant = a.back().first - a[0].first;
    pair<int,int> ans;
    int l = 0;
    int r = 0;
    for(;r < n;++r) {
        sets[a[r].second]++;
        while(sets.size() == total_set) {
            int id = a[l].second;
            int cand_distant = a[r].first - a[l].first;
            if(cand_distant <= min_distant) {
                ans = {l, r};
                min_distant = cand_distant;
            }
            sets[id]--;
            if(sets[id] == 0) sets.erase(id);
            l++;
        }
    }
    vector<pair<int,int>> display_ans;
    vector<bool> wear(total_set+1, false);
    l = ans.first;
    r = ans.second;
    for(int i=l;i<=r;++i) {
        int id = a[i].second;
        if(!wear[id]) {
            display_ans.emplace_back(a[i].second,a[i].first);
            wear[id] = true;
        }
    }
    sort(display_ans.begin(), display_ans.end());
    for(int i=0;i<total_set;++i) {
        cout<<display_ans[i].second<<' ';
    }
    cout<<endl;
}