/* -*- coding: utf-8 -*-
 *
 * 3068.cc:  No.3068 Speedrun (Hard) - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* subroutines */

// x+y=u,rx+sy=v
// |1 1|*|x|=|u| -> |s s|*|x|=|su| -> (s-r)x=(su-v) -> x=(su-v)/(s-r)
// |r s| |y| |v|    |r s| |y| | v|
// -> |r r|*|x|=|ru| -> (r-s)y=ru-v -> y=-(ru-v)/(s-r)
//    |r s| |y| | v|

void calc(int c, int d, int r, int s, int u, int v, int &x, int &y) {
  x = y = -1;

  if (r == s) {
    if (c + d <= u && r * u == v) x = min(c, u), y = u - x;
    return;
  }

  int x0 = s * u - v, y0 = r * u - v, sr = s - r;
  if (x0 % sr == 0 && y0 % sr == 0) x = x0 / sr, y = -y0 / sr;
  if (x < 0 || x > c || y < 0 || y > d) x = y = -1;
}

/* main */

int main() {
  int a, b, c, d, n, p, q, r, s, t;
  scanf("%d%d%d%d%d%d%d%d%d%d", &a, &b, &c, &d, &n, &p, &q, &r, &s, &t);


  for (int i = 0; i <= a && i <= n && p * i <= t; i++)
    for (int j = 0; j <= b && i + j <= n && p * i + q * j <= t; j++) {
      int u = n - (i + j);
      int v = t - (p * i + q * j);
      int x, y;
      calc(c, d, r, s, u, v, x, y);
      if (x >= 0) {
	printf("%d %d %d %d\n", i, j, x, y);
	return 0;
      }
    }

  puts("-1");
  return 0;
}