import java.util.HashMap;
import java.util.Map;

public class Main {
  static int a, b, c, d, e, f;
  private static void solve() {
    a = ni();
    b = ni();
    c = ni();
    d = ni();
    e = ni();
    f = ni();
    
    int[] ret = dfs(0, 0);
    out.println(ret[0] + ret[1] + " " + ret[1]);
  }

  private static Map<Long, int[]> memo = new HashMap<>();
  private static int[] dfs(int water, int salt) {
    if ((salt + water) > 0 && (water + salt > f || salt * (100 + e) > e * (salt + water))) {
      return new int[] {100, 0};
    }
    
    long hash = hash(water, salt);
    if (memo.containsKey(hash)) {
      return memo.get(hash);
    }

    int[] ret = new int[] {water, salt};
    int[] now;
    
    now = dfs(water + 100 * a, salt);
    if (cmp(ret, now) < 0) {
      ret = now;
    }
    now = dfs(water + 100 * b, salt);
    if (cmp(ret, now) < 0) {
      ret = now;
    }
    now = dfs(water, salt + c);
    if (cmp(ret, now) < 0) {
      ret = now;
    }
    now = dfs(water, salt + d);
    if (cmp(ret, now) < 0) {
      ret = now;
    }
    
    memo.put(hash, ret);
    return ret;
  }
  
  private static long hash(int water, int salt) {
    return (long)water * 10000 + salt;
  }
  private static int cmp(int[] a, int[] b) {
    int x = a[1] * (b[0] + b[1]);
    int y = b[1] * (a[0] + a[1]);
    return x == y && x == 0 ? (a[0] + a[1]) - (b[0] + b[1]) : x - y ;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = System.getProperty("debug");
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}




Measured memory_bytes: 24788