#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
//#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int a, b, c, d, n, p, q, r, s, t;
	cin >> a >> b >> c >> d >> n >> p >> q >> r >> s >> t;
	rep(i, n + 1) {
		unordered_map<int, pair<int, int>> mp;
		rep(aa, a + 1) {
			int bb = i - aa;
			if (bb < 0 || bb>b)continue;
			mp[aa * p + bb * q] = { aa,bb };
		}
		int j = n - i;
		rep(cc, c + 1) {
			int dd = j - cc;
			if (dd < 0 || dd>d)continue;
			int x = t - cc * r - dd * s;
			if (mp.count(x)) {
				auto[aa, bb] = mp[x];
				cout << aa << " " << bb << " " << cc << " " << dd << endl;
				return 0;
			}
		}
	}
	return 0;
}