#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

const int MAX = 30010;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int K, L, M, N;
    ll S;
    cin >> K >> L >> M >> N >> S;
    vector<int> A(K), B(L), C(M), D(N);
    for (int& x : A) cin >> x;
    for (int& x : B) cin >> x;
    for (int& x : C) cin >> x;
    for (int& x : D) cin >> x;

    vector<vector<int>> v(2);
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < N; j++) {
            int prod = C[i] * D[j];
            v[prod >= 0].emplace_back(abs(prod));
        }
    }
    for (auto& x : v) sort(x.begin(), x.end());

    vector<vector<int>> cnt(2, vector<int>(MAX, 0)), sum(2, vector<int>(MAX + 1, 0));
    for (int x : D) cnt[x >= 0][abs(x)]++;
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < MAX; j++) {
            sum[i][j + 1] = sum[i][j] + cnt[i][j];
        }
    }

    auto calc = [&](ll x, ll prod) {
        if (prod == 0) return (prod <= x ? N : 0);
        int res = 0;
        ll prop = (abs(x) + abs(prod) - 1) / abs(prod);
        if (prod < 0) {
            if (x < 0) {
                // positive and val >= prop
                // res += sum[1][MAX] - sum[1][min(ll(MAX), prop)];
                res += v[1].end() - lower_bound(v[1].begin(), v[1].end(), prop);
            } else {
                // all positive or negative and val < prop
                if (abs(x) % abs(prod) == 0) prop++;
                // res += sum[1][MAX];
                // res += sum[0][min(ll(MAX), prop)];
                res += v[1].size();
                res += lower_bound(v[0].begin(), v[0].end(), prop) - v[0].begin();
            }
        } else {
            if (x < 0) {
                // negative and val >= prop
                // res += sum[0][MAX] - sum[0][min(ll(MAX), prop)];
                res += v[0].end() - lower_bound(v[0].begin(), v[0].end(), prop);
            } else {
                // all negative or positive and val < prop
                if (abs(x) % abs(prod) == 0) prop++;
                // res += sum[0][MAX];
                // res += sum[1][min(ll(MAX), prop)];
                res += v[0].size();
                res += lower_bound(v[1].begin(), v[1].end(), prop) - v[1].begin();
            }
        }
        // debug(x, prod, prop, res);
        return res;
    };
    auto check = [&](ll x) {
        ll cnt = 0;
        for (int i = 0; i < K; i++) {
            for (int j = 0; j < L; j++) {
                cnt += calc(x, A[i] * B[j]);
            }
        }
        // debug(x, cnt);
        return cnt >= S;
    };
    ll lb = -IINF, ub = IINF;
    while (ub - lb > 1) {
        ll mid = (ub + lb) >> 1LL;
        (check(mid) ? ub : lb) = mid;
        // break;  // TODO: erase
    }

    cout << ub << '\n';

    for (int i = 0; i < K; i++) {
        for (int j = 0; j < L; j++) {
            for (int k = 0; k < M; k++) {
                ll prod = (ll)A[i] * B[j] * C[k];
                if (ub == 0 && prod == 0) {
                    cout << A[i] << ' ' << B[j] << ' ' << C[k] << ' ' << D[0] << '\n';
                    return 0;
                }
                if (prod == 0) continue;
                if (ub % prod != 0) continue;
                ll tar = ub / prod;
                if (abs(tar) >= MAX) continue;
                bool ok = false;
                if (tar < 0) {
                    if (cnt[0][-tar]) {
                        ok = true;
                    }
                } else {
                    if (cnt[1][tar]) {
                        ok = true;
                    }
                }
                if (ok) {
                    cout << A[i] << ' ' << B[j] << ' ' << C[k] << ' ' << tar << '\n';
                    return 0;
                }
            }
        }
    }
    return 0;
}