#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, P, Q, R, S, T, N;
	cin >> A >> B >> C >> D >> P >> Q >> R >> S >> T >> N;

	unordered_map<int, pair<int, int>> memo;
	for (int x = 0; x <= A; x++) {
		for (int y = 0; y <= B; y++) {
			int sum_time = P * x + Q * y;
			int sum_count = x + y;
			if (sum_time <= T && sum_count <= N) {
				memo[sum_time] = { x, y };
			}
		}
	}
	for (int z = 0; z <= C; z++) {
		for (int w = 0; w <= D; w++) {
			int remain_time = T - (R * z + S * w);
			int remain_count = N - (z + w);
			if (memo.count(remain_time) && memo[remain_time].first + memo[remain_time].second == remain_count) {
				int x = memo[remain_time].first;
				int y = memo[remain_time].second;
				cout << x << " " << y << " " << z << " " << w << endl;
				return 0;
			}
		}
	}

	return 0;
}