#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <typename T> bool chmin(T &x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T &x, T y) {
	return x < y ? (x = y, true) : false;
}

struct IOST {
	IOST() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(20);
	}
} IOST;

using mint = atcoder::modint998244353;

int main(){
	ll n,t;
	vector<ll> a(4),b(4);
	rep(i,0,4) cin>>a[i];
	cin>>n;
	rep(i,0,4) cin>>b[i];
	cin>>t;
	int flg=0;
	if(b[2]<b[3]){
		swap(b[2],b[3]);
		swap(a[2],a[3]);
		flg=1;
	}
	rep(x,0,a[0]+1) rep(y,0,a[1]+1){
		ll nn=n-x-y;
		if(nn<0) break;
		ll tt=t-b[0]*x-b[1]*y;
		if(tt<0) break;
		if(b[2]==b[3]){
			if(b[2]*nn!=tt) continue;
			ll ct=tt/b[2];
			if(ct>a[2]+a[3]) continue;
			ll tmp=min(ct,a[2]);
			if(flg) tmp=ct-tmp;
			cout<<x<<" "<<y<<" "<<tmp<<" "<<ct-tmp<<"\n";
			return 0;
		}else{
			tt-=b[3]*nn;
			if(t<0) continue;
			ll d=b[2]-b[3];
			if(tt%d!=0) continue;
			ll ct=tt/d;
			if(ct>a[2]||nn-ct>a[3]) continue;
			if(flg) ct=nn-ct;
			cout<<x<<" "<<y<<" "<<ct<<" "<<nn-ct<<"\n";
			return 0;
		}
	}
}