#include typedef long long ll; typedef unsigned long long ull; #define FOR(i,a,b) for(int (i)=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) #define RANGE(vec) (vec).begin(),(vec).end() using namespace std; array A,B,C; int Db,Dc; ll dp[11][101][10001]; class StrangeErrand { public: ll calc(int a, int b, int c) { if (dp[a][b][c] >= 0) return dp[a][b][c]; ll maxCnt = 0; REP(i,a+1) REP(j,b+1) { int restDb = Db - i*1000 - j*100; int restDc = Dc - i*1000 - j*100; if (restDb >= 0 && restDb <= c) maxCnt = max(calc(a-i+B[0],b-j+B[1],c-restDb+B[2])+1, maxCnt); if (restDc >= 0 && restDc <= c) maxCnt = max(calc(a-i+C[0],b-j+C[1],c-restDc+C[2])+1, maxCnt); } return dp[a][b][c] = maxCnt; } void solve(void) { REP(i,3) cin>>A[i]; cin>>Db; REP(i,3) cin>>B[i]; cin>>Dc; REP(i,3) cin>>C[i]; REP(i,11) REP(j,101) REP(k,10001) dp[i][j][k] = -1; cout<solve(); delete obj; return 0; } #endif