#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define INF 9e18;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    ll A,B,C,D,N,P,Q,R,S,T;
    cin>>A>>B>>C>>D>>N>>P>>Q>>R>>S>>T;
    vector<ll>data1[20009];
    vector<ll>data2[20009];
    for(int i=0;i<=A;i++){
        for(int j=0;j<=B;j++){
            data1[i+j].push_back(i*P+j*Q);
        }
    }
    for(int i=0;i<=C;i++){
        for(int j=0;j<=D;j++){
            data2[i+j].push_back(i*R+j*S);
        }
    }
    for(int i=0;i<=A+B;i++){
        sort(data1[i].begin(),data1[i].end());
    }
    for(int i=0;i<=C+D;i++){
        sort(data2[i].begin(),data2[i].end());
    }
    ll AB=0,CD=0;
    for(int i=0;i<=N;i++){
        for(ll j=0;j<data1[i].size();j++){
            if(binary_search(data2[N-i].begin(),data2[N-i].end(),T-data1[i].at(j))==true){
                AB=data1[i].at(j);
                CD=T-AB;
            }
        }
    }
    bool already=false;
    for(int i=0;i<=A;i++){
        for(int j=0;j<=B;j++){
            if(i*P+j*Q==AB){
                cout<<i<<" "<<j<<" ";
                already=true;
                break;
            }
        }
        if(already==true) break;
    }
    already=false;
    for(int i=0;i<=C;i++){
        for(int j=0;j<=D;j++){
            if(i*R+j*S==CD){
                cout<<i<<" "<<j<<" ";
                already=true;
                break;
            }
        }
        if(already==true) break;
    }
}