/** author: shobonvip created: 2025.03.21 22:09:45 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); vectora(4),b(4); rep(i,0,4)cin>>a[i]; int n;cin>>n; rep(i,0,4)cin>>b[i]; int t;cin>>t; int mode=0; if(b[0]>b[1]){ swap(a[0],a[1]); swap(b[0],b[1]); mode|=1; } if(b[2] ans; rep(i,0,n+1){ vectormemo; vectorxt; vectoryt; rep(x,0,a[0]+1){ int y=i-x; if(!(0<=y&&y<=a[1]))continue; int g=x*b[0]+y*b[1]; memo.push_back(g); xt.push_back(x); yt.push_back(y); } int p=0; rep(x,0,a[2]+1){ int y=n-i-x; if(!(0<=y&&y<=a[3]))continue; int g=x*b[2]+y*b[3]; while(p<(int)memo.size()&&g+memo[p]>t){ p++; } if(p<(int)memo.size()&&g+memo[p]==t){ ans={xt[p],yt[p],x,y}; break; } } } if(mode&1)swap(ans[0],ans[1]); if(mode&2)swap(ans[2],ans[3]); cout<