#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr double eps=1e-9;
const double PI=acos(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}
int A,B,C,D,f[601],za,zb;
ll N;
int main(){
  startupcpp();
  ll i,j;
  cin>>A>>B>>C>>D>>N;
  vec pa,ma,pb,mb;
  map<int,pair<int,int>> mpa,mpb;
  rep(i,A)cin>>f[i];
  rep(i,B){
    int x;
    cin>>x;
    rep(j,A){
      mpa[x*f[j]]=pair<int,int>(f[j],x);
      if(x*f[j]>0)pa.emplace_back(x*f[j]);
      else if(x*f[j]<0)ma.emplace_back(-x*f[j]);
      else ++za;
    }
  }
  rep(i,C)cin>>f[i];
  rep(i,D){
    int x;
    cin>>x;
    rep(j,C){
      mpb[x*f[j]]=pair<int,int>(f[j],x);
      if(x*f[j]>0)pb.emplace_back(x*f[j]);
      else if(x*f[j]<0)mb.emplace_back(-x*f[j]);
    }
  }
  A=A*B;
  B=C*D;
  vsort(pa);vsort(pb);vsort(ma);vsort(mb);
  debug(pa,pb,ma,mb);
  ll msize=(ll)pa.size()*mb.size()+(ll)pb.size()*ma.size();
  if(msize>=N){
    ll ok=0,ng=inf;
    while(ng-ok>1){
      ll mid=(ok+ng)/2,cnt=0;
      for(auto x:pa)cnt+=mb.end()-lower_bound(all(mb),(mid+x-1)/x);
      for(auto x:pb)cnt+=ma.end()-lower_bound(all(ma),(mid+x-1)/x);
      if(cnt<N)ng=mid;
      else ok=mid;
    }
    print(-ok);
    for(auto x:ma){
      if(ok%x)continue;
      if(mpb.count(ok/x)){
        print(mpa[-x].first<<" "<<mpa[-x].second<<" "<<mpb[ok/x].first<<" "<<mpb[ok/x].second);
        return 0;
      }
    }
    for(auto x:mb){
      if(ok%x)continue;
      if(mpa.count(ok/x)){
        print(mpa[ok/x].first<<" "<<mpa[ok/x].second<<" "<<mpb[-x].first<<" "<<mpb[-x].second);
        return 0;
      }
    }
  }else{
    N-=msize;
    ll zsize=A*zb+B*za-za*zb;
    if(zsize>=N){
      print(0);
      if(za){
        auto& x=mpb.begin()->second;
        print(mpa[0].first<<" "<<mpa[0].second<<" "<<x.first<<" "<<x.second);
      }else{
        auto& x=mpa.begin()->second;
        print(x.first<<" "<<x.second<<mpb[0].first<<" "<<mpb[0].second);
      }
    }else{
      N-=zsize;
      ll ok=inf,ng=0;
      while(ok-ng>1){
        ll mid=(ok+ng)/2,cnt=0;
        for(auto x:pa)cnt+=upper_bound(all(pb),mid/x)-pb.begin();
        for(auto x:ma)cnt+=upper_bound(all(mb),mid/x)-mb.begin();
        if(cnt<N)ng=mid;
        else ok=mid;
      }
      print(ok);
      for(auto x:pa){
        if(ok%x)continue;
        if(mpb.count(ok/x)){
          print(mpa[x].first<<" "<<mpa[x].second<<" "<<mpb[ok/x].first<<" "<<mpb[ok/x].second);
          return 0;
        }
      }
      for(auto x:ma){
        if(ok%x)continue;
        if(mpb.count(-ok/x)){
          print(mpa[-x].first<<" "<<mpa[-x].second<<" "<<mpb[-ok/x].first<<" "<<mpb[-ok/x].second);
          return 0;
        }
      }
    }
  }
}