#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;

ll extgcd(ll a, ll b, ll &x, ll &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a >= 0 ? a : -a;
    }
    ll x1, y1;
    ll g = extgcd(b, a % b, x1, y1);
    x = y1;
    y = x1 - (a / b) * y1;
    return g;
}

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;
        ll numY = ax * m - n * bx;
        if (numX % D != 0 || numY % D != 0)
            return {INF, INF};
        return {numX / D, numY / D};
    }
    if (ax * m != bx * n || ay * m != by * n) {
        return {INF, INF};
    }
    if (ax == 0 && ay == 0) {
        return {0, 0};
    }
    if (ax == 0) {
        return {0, n / ay};
    }
    if (ay == 0) {
        return {n / ax, 0};
    }
    ll x0, y0;
    ll g = extgcd(ax, ay, x0, y0);
    ll k = n / g;
    return {x0 * k, y0 * k};
}

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 (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();
    }
}