Gleb 2

n1 = int(input())
nums1 = sorted(map(int, input().split()))
n2 = int(input())
nums2 = sorted(map(int, input().split()))
n3 = int(input())
nums3 = sorted(map(int, input().split()))
n4 = int(input())
nums4 = sorted(map(int, input().split()))


p1 = p2 = p3 = p4 = 0
best = (nums1[p1], nums2[p2], nums3[p3], nums4[p4])

while True:
    mn = min(nums1[p1], nums2[p2], nums3[p3], nums4[p4])
    mx = max(nums1[p1], nums2[p2], nums3[p3], nums4[p4])
    if mx - mn < max(best) - min(best):
        best = (nums1[p1], nums2[p2], nums3[p3], nums4[p4])

    if nums1[p1] == mn:
        p1 += 1
        if p1 == n1:
            break
    elif nums2[p2] == mn:
        p2 += 1
        if p2 == n2:
            break
    elif nums3[p3] == mn:
        p3 += 1
        if p3 == n3:
            break
    elif nums4[p4] == mn:
        p4 += 1
        if p4 == n4:
            break

print(best[0], best[1], best[2], best[3])