#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 100000000

typedef long long ll;

int dp[11][101][10001];
bool used[11][101][100001];
int a[3], b[3], c[3];
int db, dc;

int count(int x, int y, int z) {
    if (used[x][y][z])
        return dp[x][y][z];
    used[x][y][z] = true;
    if (db <= x*1000+y*100+z && db%100<=z && db%1000<=y*100+z) {
        int nx = min(x,db/1000);
        int ny = min(y,(db-nx*1000)/100);
        int nz = min(z,db-nx*1000-ny*100);
        dp[x][y][z] = max(dp[x][y][z],count(x-nx+b[0],y-ny+b[1],z-nz+b[2])+1);
    }
    if (dc <= x*1000+y*100+z && dc%100<=z && dc%1000<=y*100+z) {
        int nx = min(x,dc/1000);
        int ny = min(y,(dc-nx*1000)/100);
        int nz = min(z,dc-nx*1000-ny*100);
        dp[x][y][z] = max(dp[x][y][z],count(x-nx+c[0],y-ny+c[1],z-nz+c[2])+1);
    }
    return dp[x][y][z];
}

int main() {
    int i;
    rep (i,3) cin >> a[i];
    cin >> db;
    rep (i,3) cin >> b[i];
    cin >> dc;
    rep (i,3) cin >> c[i];
    cout << count(a[0],a[1],a[2]) << endl;
    return 0;
}