#include <bits/stdc++.h>

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::array<int, 4> n;
    std::array<int, 6> ans{-1};
    std::array<std::vector<int>, 4> a;
    for (int i = 0; i < 4; ++i)
    {
        std::cin >> n[i];
        a.fill(std::vector<int>(n[i]));
        for (int j = 0; j < n[i]; ++j)
            std::cin >> a[i][j];
    }
    while (!(a[0].empty() || a[1].empty() || a[2].empty() || a[3].empty()))
    {
        std::array<int, 4> back{a[0].back(), a[1].back(), a[2].back(), a[3].back()};
        std::sort(back.begin(), back.end());
        if (ans[0] < 0 || back[3] - back[0] < ans[5] - ans[4])
        {
            ans[0] = a[0].back();
            ans[1] = a[1].back();
            ans[2] = a[2].back();
            ans[3] = a[3].back();
            ans[4] = back[0];
            ans[5] = back[3];
        }
        switch (back[3])
        {
            case a[0].back():
                a[0].pop();
                break;
            case a[1].back():
                a[1].pop();
                break;
            case a[2].back():
                a[2].pop();
                break;
            case a[3].back():
                a[3].pop();
        }
    }
    std::cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << ' ' << ans[3] << std::endl;

    return 0;
}