#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll a, b, c, d, n;
  cin >> a >> b >> c >> d >> n;
  ll p, q, r, s, t;
  cin >> p >> q >> r >> s >> t;
  p -= s, q -= s, r -= s;
  t -= n * s;
  rep(x, a + 1) rep(y, b + 1) {
    ll rest = t - (p * x + q * y);
    if (r) {
      ll z = rest / r, w = n - x - y - z;
      if (rest % r == 0 && 0 <= z && z <= c && 0 <= w && w <= d) {
        cout << x << ' ' << y << ' ' << z << ' ' << w << '\n';
        return 0;
      }
    } else if (rest == 0) {
      // 0<=z<=c
      // 0<=n-x-y-z<=d
      ll lz = max(0LL, n - x - y - d), rz = min(c, n - x - y);
      if (lz <= rz) {
        cout << x << ' ' << y << ' ' << lz << ' ' << n - x - y - lz << '\n';
        return 0;
      }
    }
  }
  assert(false);
}