#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace std;

typedef long long ll;

#include <utility>
using ll = long long;

inline pair<ll, ll> f(ll ax, ll ay, ll n, ll bx, ll by, ll m) {
    const ll INF = (ll)1e18;
    ll D = ax * by - ay * bx;
    if (D != 0) {
        ll numX = n * by - ay * m;
        if (numX % D != 0)
            return {-1, -1};
        ll x = numX / D;
        ll rem = n - ax * x;
        if (ay != 0) {
            if (rem % ay != 0)
                return {-1, -1};
            return {x, rem / ay};
        }
        if (rem != 0)
            return {-1, -1};
        ll rem2 = m - bx * x;
        if (by == 0 || rem2 % by != 0)
            return {-1, -1};
        return {x, rem2 / by};
    }
    if (ax * m == bx * n && ay * m == by * n)
        return {INF, INF};
    return {-1, -1};
}

void solve() {
    ll a, b, c, d, n, p, q, r, s, t;
    cin >> a >> b >> c >> d >> n >> p >> q >> r >> s >> t;
    rep(nc, 0, c + 1) rep(nd, 0, d + 1) {
        ll nn = n - nc - nd;
        ll nt = t - nc * r - nd * s;
        auto [na, nb] = f(p, q, nt, 1, 1, nn);
        if (na == 1e18) {
            na = a, nb = nn - a;
        }
        if (0 <= na && na <= a && 0 <= nb && nb <= b) {
            cout << na << ' ' << nb << ' ' << nc << ' ' << nd << '\n';
            return;
        }
    }
}

int main() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int t = 1;
    while (t--) {
        solve();
    }
}