#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int A,B,C,D,N;
int P,Q,R,S,T;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>A>>B>>C>>D>>N;
	cin>>P>>Q>>R>>S>>T;
	
	for(int a=0;a<=A;a++) for(int b=0;b<=B;b++) {
		int tim=a*P+b*Q;
		if(a+b>N||tim>T) continue;
		
		if(R==S) {
			if((T-tim)%R==0&&(T-tim)/R<=C+D) {
				x=min(C,(T-tim)/R);
				y=(T-tim)/R-x;
				cout<<a<<" "<<b<<" "<<x<<" "<<y<<endl;
				return;
			}
		}
		else {
			// x+y==N-(a+b)
			// R*x+S*y=T-tim;
			ll v=S-R;
			ll w=(T-tim)-R*(N-(a+b));
			if(w%v) continue;
			y=w/v;
			x=N-(a+b)-y;
			if(x>=0&&x<=C&&y>=0&&y<=D) {
				cout<<a<<" "<<b<<" "<<x<<" "<<y<<endl;
				return;
			}
		}
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}