#include <iostream>
#include <sstream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <queue> 
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <ctime>
#include <assert.h>
#include <deque>
#include <list>
#include <stack>
#include <numeric>
#include <iomanip>

using namespace std;
 
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef pair<long long , long long> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<int, long long > pil;
typedef pair<long long, pii> plii;
typedef pair<double, int> pdi;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ull, ull> puu;
typedef long double ld;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f, MID = 333;
const long double EPS = 1e-8;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// int dx[8] = {2, 1, -1, -2, -2, -1, 1, 2}, dy[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int n, m, cnt;
int w[N];
vector<ll> num;
ll res;

ll lowbit(ll x) { return x & -x; }
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
inline double rand(double l, double r) { return (double)rand() / RAND_MAX * (r - l) + l; }
inline ll qmi(ll a, ll b, ll c) { ll res = 1; while (b) { if (b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; }
inline ll qmi(ll a, ll b) { ll res = 1; while (b) { if (b & 1) res *= a; a *= a; b >>= 1; } return res; }
inline double qmi(double a, ll b) { double res = 1; while (b) { if (b & 1) res *= a; a *= a; b >>= 1; } return res; } 
inline ll C(ll a, ll b, int* c) { if (a < b) return 0; ll res = 1; for (ll j = a, i = 1; i < b + 1; i++, j--) res *= j; for (ll j = a, i = 1; i < b + 1; i++, j--) res /= i; return res; }
inline int find_(int x) { return lower_bound(num.begin(), num.end(), x) - num.begin(); }

int ans[10];
struct Node {
    int c, v;
}e[10];


int main() {
    for (int i = 1; i < 5; i++) cin >> e[i].c;
    cin >> n;
    for (int i = 1; i < 5; i++) cin >> e[i].v;
    cin >> m;

    for (int i = 0; i <= e[1].c; i++)
        for (int j = 0; j <= e[2].c; j++) {
            int a = n - i - j, b = m - i * e[1].v - j * e[2].v;
            if (e[3].v == e[4].v) {
                if (e[3].c + e[4].c >= a && (ll)a * e[3].v == b) {
                    printf("%d %d ", i, j);
                    if (e[3].c >= a) printf("%d 0\n", a);
                    else printf("%d %d\n", e[3].c, a - e[3].c);
                    return 0;
                }
            } else {
                if (e[3].v - e[4].v < 0 && b - e[4].v * a > 0) continue;
                if (e[3].v - e[4].v > 0 && b - e[4].v * a < 0) continue;
                int l = abs(b - e[4].v * a), r = abs(e[3].v - e[4].v);
                if (l % r) continue;
                int x = l / r, y = a - x;
                if (x >= 0 && x <= e[3].c && y >= 0 && y <= e[4].c) {
                    assert(i + j + x + y == n);
                    assert((ll)i * e[1].v + j * e[2].v + x * e[3].v + y * e[4].v == m);
                    printf("%d %d %d %d\n", i, j, x, y);
                    return 0;
                }
            }
        }
    return 0;
}