#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, a + 1)rep(j, b + 1) {
		long long x = n - i - j;//k,l;
		long long y = t - i * p - j * q;// ck+dl
		if (r == s) {
			if (r * x != y)continue;
			if (c + d < x)continue;
			int a0 = min(c, (int)x);
			int a1 = x - a0;
			cout << i << " " << j << " " << a0 << " " << a1 << endl;
			return 0;
		}
		else {
			long long a1 = r * x - y;
			if (a1 % (r - s))continue;
			a1 /= r - s;
			long long a0 = x - a1;
			if (a0 < 0 || c < a0)continue;
			if (a1 < 0 || d < a1)continue;
			cout << i << " " << j << " " << a0 << " " << a1 << endl;
			return 0;
		}
	}
	return 0;
}