#include using namespace std; #define REP(i,a,b) for(i=a;i'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);} void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);} void reader(double *x){scanf("%lf",x);} int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;} template void reader(T *x, S *y){reader(x);reader(y);} template void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);} template void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);} void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);} void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);} void writer(double x, char c){printf("%.15f",x);mypc(c);} void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);} void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);} template void writerLn(T x){writer(x,'\n');} template void writerLn(T x, S y){writer(x,' ');writer(y,'\n');} template void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');} template void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');} char memarr[17000000]; void *mem = memarr; #define MD 1000000007 int A[3], B[3], C[3], DB, DC; int dp[11][111][11111]; int solve(int a, int b, int c){ int i, j, k; int aa, bb, cc; int res = 0, tmp; // writerLn(a,b,c); if(dp[a][b][c] >= 0) return dp[a][b][c]; i = DB / 1000; j = (DB / 100) % 10; k = DB % 100; aa = a - i; bb = b - j; cc = c - k; if(aa < 0) bb+=aa*10, aa=0; if(bb < 0) cc+=bb*100, bb=0; if(cc >= 0){ tmp = solve(aa+B[0], bb+B[1], cc+B[2]) + 1; res = max(res, tmp); } i = DC / 1000; j = (DC / 100) % 10; k = DC % 100; aa = a - i; bb = b - j; cc = c - k; if(aa < 0) bb+=aa*10, aa=0; if(bb < 0) cc+=bb*100, bb=0; if(cc >= 0){ tmp = solve(aa+C[0], bb+C[1], cc+C[2]) + 1; res = max(res, tmp); } return dp[a][b][c] = res; } int main(){ int i, j, k; int res; reader(A,A+1,A+2); reader(&DB); reader(B,B+1,B+2); reader(&DC); reader(C,C+1,C+2); rep(i,11) rep(j,111) rep(k,11111) dp[i][j][k] = -1; res = solve(A[0],A[1],A[2]); writerLn(res); return 0; }