#include <iostream>
#define REP(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,a) REP(i,0,a)
using namespace std;

int A1, A2, A3, B1, B2, B3, C1, C2, C3;
int x1, x2, x3, db, dc, Db, Dc;
int memo[11][101][10001];

void solve(int a1, int a2, int a3, int n) {
    if (memo[a1][a2][a3] > n) return;
    if (1000*a1+100*a2+a3 >= Db) {
        x1 = a1, x2 = a2, x3 = a3, db = Db;
        rep(i, a1) {
            if (db >= 1000) db -= 1000, x1 -= 1;
            else break;
        }
        rep(i, a2) {
            if (db >= 100) db -= 100, x2 -= 1;
            else break;
        }
        rep(i, a3) {
            if (db >= 1) db -= 1, x3 -= 1;
            else break;
        }
        if (db == 0) {
            memo[a1][a2][a3] = n+1;
            solve(x1+B1, x2+B2, x3+B3, n+1);
        }
    }

    if (1000*a1+100*a2+a3 >= Dc) {
        x1 = a1, x2 = a2, x3 = a3, dc = Dc;
        rep(i, a1) {
            if (dc >= 1000) dc -= 1000, x1 -= 1;
            else break;
        }
        rep(i, a2) {
            if (dc >= 100) dc -= 100, x2 -= 1;
            else break;
        }
        rep(i, a3) {
            if (dc >= 1) dc -= 1, x3 -= 1;
            else break;
        }
        if (dc == 0) {
            memo[a1][a2][a3] = n+1;
            solve(x1+C1, x2+C2, x3+C3, n+1);
        }
    }   
}

int main(void){
    cin >> A1 >> A2 >> A3;
    cin >> Db;
    cin >> B1 >> B2 >> B3;
    cin >> Dc;
    cin >> C1 >> C2 >> C3;

    solve(A1,A2,A3,0);

    int ans = 0;
    rep(i,11) rep(j,101) rep(k,10001) ans = max(ans, memo[i][j][k]);
    cout << ans << endl;
    return 0;
}