import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.AbstractMap;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;


public class Main {
	
	public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyInput in = new MyInput(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        
        Solver solver = new Solver();
        solver.solve(1, in, out);
        
        out.close();
    }
    
    // ======================================================================
	// 入力　：　 2 <= N <= 50　　＝　点の数		1 <= M <= min(N *(N - 1) / 2, 50)　　＝　辺の数
	//　　　　　　　M 個の　点の組み合わせ	 ui, vi
	//
	// 橋の数は？
	// 
	// 辺を１つづつ、消して、深さ優先探索で全部の点にたどり着くかをチェックする　→　再帰で処理する
	//
    static class Solver {
//    	int A, B, C, D, E, F;
//    	double[][][][] dp = new double[110][110][110][110];
    	
    	public void solve(int testNumber, MyInput in, PrintWriter out) {
			int A = in.nextInt() * 100;
			int B = in.nextInt() * 100;
			int C = in.nextInt();
			int D = in.nextInt();
			int E = in.nextInt();
			int F = in.nextInt();
			int svW = 0, svS = 0;
			double sv = 0;
			int WA, W, SC, S;
			double wk;
			for(int a=0; a < 110; a++) {
				WA = A * a;
				if(WA >= F)	continue;
				for(int b=0; b < 110; b++) {
					W = WA + B * b;
					if(W >= F)	continue;
					for(int c=0; c < 110; c++) {
						SC = C * c;
						if((W + SC) > F)		continue;
						if(SC > (E * W) / 100)	continue;
						for(int d=0; d < 110; d++) {
							S = SC + D * d;
							if((W + S) > F)		continue;
							if(S > (E * W) / 100)	continue;
							if(S + W == 0)		continue;
							wk = (double)(S * 100) / (double)(S + W);
							if(wk > sv) {
								svW = W;
								svS = S;
								sv = wk;
							}
						}
					}
				}
			}
			svW += svS;
			if(svW == 0) {
			    svW = A;
			}
			out.println(svW + " " + svS);
        }
    }
    // ======================================================================
    static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {
        /** serialVersionUID. */
        private static final long serialVersionUID = 6411527075103472113L;

        public Pair(final K key, final V value) {
            super(key, value);
        }
        public String getString() {
            return "[" + getKey() + "] [" + getValue() + "]";
        }
     }    
    static class MyInput {
        private final BufferedReader in;
        private static int pos;
        private static int readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500 * 8 * 2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];
 
        static {
            for (int i = 0; i < 10; i++) {
                isDigit['0' + i] = true;
            }
            isDigit['-'] = true;
            isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
            isLineSep['\r'] = isLineSep['\n'] = true;
        }
 
        public MyInput(InputStream is) {
            in = new BufferedReader(new InputStreamReader(is));
        }
 
        public int read() {
            if (pos >= readLen) {
                pos = 0;
                try {
                    readLen = in.read(buffer);
                } catch (IOException e) {
                    throw new RuntimeException();
                }
                if (readLen <= 0) {
                    throw new MyInput.EndOfFileRuntimeException();
                }
            }
            return buffer[pos++];
        }
 
        public int nextInt() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            int ret = 0;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
        public long nextLong() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            long ret = 0L;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
        public String nextString() {
        	String ret = new String(nextDChar()).trim();
            return ret;
        }
 
        public char[] nextDChar() {
            int len = 0;
            len = reads(len, isSpace);
            char[] ret = new char[len + 1];
            for (int i=0; i < len; i++)		ret[i] = str[i];
            ret[len] = 0x00;
            return ret;
        }
 
        public char nextChar() {
            while (true) {
                final int c = read();
                if (!isSpace[c]) {
                    return (char) c;
                }
            }
        }
 
        int reads(int len, boolean[] accept) {
            try {
                while (true) {
                    final int c = read();
                    if (accept[c]) {
                        break;
                    }
                    if (str.length == len) {
                        char[] rep = new char[str.length * 3 / 2];
                        System.arraycopy(str, 0, rep, 0, str.length);
                        str = rep;
                    }
                    str[len++] = (char) c;
                }
            } catch (MyInput.EndOfFileRuntimeException e) {
            }
            return len;
        }
 
        static class EndOfFileRuntimeException extends RuntimeException {
        }
    }
}


Measured memory_bytes: 22996