#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; cin >> a >> b >> c >> d;
	int n; cin >> n;
	int p, q, r, s; cin >> p >> q >> r >> s;
	int t; cin >> t;
	rep(x, a + 1)rep(y, min(n - x, b) + 1)rep(z, min(n - x - y, c) + 1) {
		int w = n - x - y - z;
		if (w > d)continue;
		if (w < 0)break;
		int val = x * p + y * q + z * r + w * s;
		if (val == t) {
			cout << x << " " << y << " " << z << " " << w << endl;
			return 0;
		}
	}
	return 0;
}