#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define LOCAL #include 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 istream& operator>>(istream& is, vector& v) { for (T& x : v) is >> x; return is; } template ostream& operator<<(ostream& os, const vector& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template ostream& operator<<(ostream& os, const pair& p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template ostream& operator<<(ostream& os, const tuple& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')'; return os; } template ostream& operator<<(ostream& os, const tuple& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')'; return os; } template ostream& operator<<(ostream& os, const map& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const unordered_map& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const set& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const multiset& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const unordered_set& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const deque& 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 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 T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template T lcm(T x, T y) { return x / gcd(x, y) * y; } template inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template 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; int main() { cin.tie(0); ios::sync_with_stdio(false); int K, L, M, N; ll S; cin >> K >> L >> M >> N >> S; vector 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> 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()); auto calc = [&](ll x, int prod) { if (prod == 0) return (prod <= x ? M * 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 += 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 += 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 += 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 += v[0].size(); res += lower_bound(v[1].begin(), v[1].end(), prop) - v[1].begin(); } } 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]); } } return cnt >= S; }; ll lb = -IINF, ub = IINF; while (ub - lb > 1) { ll mid = (ub + lb) >> 1LL; (check(mid) ? ub : lb) = mid; } cout << ub << '\n'; for (int i = 0; i < K; i++) { for (int j = 0; j < L; j++) { int prod = A[i] * B[j]; if (ub == 0 && prod == 0) { cout << A[i] << ' ' << B[j] << ' ' << C[0] << ' ' << D[0] << '\n'; return 0; } if (prod == 0) continue; if (ub % prod != 0) continue; ll tar = ub / prod; bool ok = false; if (tar < 0) { if (binary_search(v[0].begin(), v[0].end(), -tar)) { ok = true; } } else { if (binary_search(v[1].begin(), v[1].end(), tar)) { ok = true; } } if (!ok) continue; for (int k = 0; k < M; k++) { for (int l = 0; l < N; l++) { if (C[k] * D[l] == tar) { cout << A[i] << ' ' << B[j] << ' ' << C[k] << ' ' << D[l] << '\n'; return 0; } } } return 0; } } return 0; }