//file_name:ABC74_C.cpp
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

    // int scan
    /*
    int x;
    scanf("%d",&x);
    int y;
    scanf("%d",&y);
    int z;
    scanf("%d",&z);

    // matrix scan
    /*
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    */

    // string scan
    /*
    string s;
    cin >> s;
    */


int main() {
    int a,b,c,d,e,f;
    cin >> a >> b >> c >> d >> e >> f;

    int dp[3001][2];
    rep(i,3001){
        rep(j,2){
            dp[i][j] = 0;
        }
    }
    dp[a*100][0] = a*100;

    int ans1 = 100*a;
    int ans2 = 0;
    
    srep(i,a*100,f+1){
        int x[4][2];
        rep(j,4){
            rep(k,2){
                x[j][k] = 0;
            }
        }
        if(dp[i-100*a][0]+dp[i-100*a][1]+100*a==i){
            x[0][0] = dp[i-100*a][0]+100*a;
            x[0][1] = dp[i-100*a][1];
        }
        if(dp[i-100*b][0]+dp[i-100*b][1]+100*b==i){
            x[1][0] = dp[i-100*b][0]+100*b;
            x[1][1] = dp[i-100*b][1];
        }
        if(dp[i-c][0]+dp[i-c][1]+c==i){
            x[2][0] = dp[i-c][0];
            x[2][1] = dp[i-c][1]+c;
            if(x[2][0]/100*e<x[2][1]){
                x[2][0]=0;
                x[2][1]=0;
            }
        }
        if(dp[i-d][0]+dp[i-d][1]+d==i){
            x[3][0] = dp[i-d][0];
            x[3][1] = dp[i-d][1]+d;
            if(x[3][0]/100*e<x[3][1]){
                x[3][0]=0;
                x[3][1]=0;
            }
        }
        rep(j,4){
            if(dp[i][1]<x[j][1]){
                dp[i][0]=x[j][0];
                dp[i][1]=x[j][1];
            }
        }
        if(dp[i][0]==0){
            rep(j,4){
                dp[i][0] = max(dp[i][0],x[j][0]);
            }
        }
        if((double)ans2/ans1<(double)dp[i][1]/i){
            ans1 = i;
            ans2 = dp[i][1];
        }
    }


    
    cout << ans1 << ' ' << ans2 << endl;
    return 0;
}



Measured memory_bytes: 256