#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
#define pq(T) priority_queue<T, vector<T>, greater<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int a, b, c, d, n, p, q, r, s, t;
  cin >> a >> b >> c >> d >> n >> p >> q >> r >> s >> t;
  int rev = 0;
  if (r > s) {
    swap(r, s), swap(c, d);
    rev = 1;
  }
  rep(x,0,a+1) rep(y,0,b+1) {
    int k = n-x-y, v = t-p*x-q*y;
    if (k < 0 || v < 0) continue;
    if (r == s) {
      if (k*r != v) continue;
      int z = min(k, c);
      int w = k-z;
      if (w < 0 || w > d) continue;
      cout << x << " " << y << " " << z << " " << w << endl;
      return 0;
    } else {
      if (v-k*r < 0 || (v-k*r)%(s-r) != 0) continue;
      int w = (v-k*r)/(s-r);
      int z = k-w;
      if (0 <= z && z <= c && 0 <= w && w <= d) {
        if(rev) swap(z, w);
        cout << x << " " << y << " " << z << " " << w << endl;
        return 0;
      }
    }
  }
  return 0;
}