#include<bits/stdc++.h> 
using namespace std;

using ll=long long;
#include<atcoder/modint>
using namespace atcoder;
using mint=modint998244353;


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

	//maybe TLE or MLE
	ll A[5],P[5];
	for(int i=0;i<5;i++)cin>>A[i];
	for(int i=0;i<5;i++)cin>>P[i];
	for(ll a=0;a<=A[0];a++){
		for(ll b=0;b<=A[1];b++){
			ll S=a*P[0]+b*P[1];
			if(S>P[4])continue;
			ll M=A[4]-a-b;
			ll Z=P[4]-S;
			if(M<0)continue;
			if(P[2]==P[3]){
				if(Z%P[2]!=0||M*P[2]!=Z)continue;
				if(A[2]+A[3]<M)continue;
				ll c=min(M,A[2]);
				ll d=M-c;
				cout<<a<<" "<<b<< " "<<c<<" "<<d<<endl;
				return 0;
			}
			else{
				ll G=Z-M*P[2];
				ll D=P[3]-P[2];
				if(G%D!=0)continue;
				ll d=G/D;
				if(d<0||d>A[3])continue;
				ll c=M-d;
				if(c<0||c>A[2])continue;
				cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
				return 0;
			}
		}
	}
	
	



}