#include <bits/stdc++.h>
//#include <atcoder/modint>

using namespace std;
//using namespace atcoder;
using ll = long long;
//using mint = modint998244353;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int N, a[4], b[4], x, y, T, S, M;
    for (int i=0; i<4; i++) cin >> a[i];
    cin >> N;
    for (int i=0; i<4; i++) cin >> b[i];
    cin >> T;

    for (int i=0; i<=a[2]; i++){
        for (int j=0; j<=a[3]; j++){
            S = T-b[2]*i-b[3]*j;
            M = N-i-j;
            if (S < 0 || M < 0) continue;
            if (b[0] != b[1]){
                if ((S-M*b[0]) % (b[1]-b[0]) != 0) continue;
                y = (S-M*b[0])/(b[1]-b[0]);
                x = M-y;
                if (0<=x && x<=a[0] && 0<=y && y<=a[1]){
                    cout << x << " " << y << " " << i << " " << j << endl;
                    return 0;
                }
            }
            else{
                if (S/b[0] != M) continue;
                x = min(M, a[0]);
                if (0<=x && x<=a[0] && 0<=y && y<=a[1]){
                    cout << x << " " << y << " " << i << " " << j << endl
;
                    return 0;
                }
            }
        }
    }

    return 0;
}