// #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
int db,dc;
vint b(3);
vint c(3);
int dp[11][101][10001];
int tmp[3]={1000,100,1};
int foo(int aa,int bb,int cc){
	if(dp[aa][bb][cc]>=0) return dp[aa][bb][cc];
	// cout<<aa<<" "<<bb<<" "<<cc<<endl;
	int ret=0;
	int t=db;
	int x[3]={aa,bb,cc};
	rep(i,3){
		while(x[i]&&tmp[i]<=t){
			x[i]--;
			t-=tmp[i];
		}
	}
	// cout<<t<<endl;
	if(t==0){
		ret=max(ret,foo(x[0]+b[0],x[1]+b[1],x[2]+b[2])+1);
	}
	t=dc;
	x[0]=aa,x[1]=bb,x[2]=cc;
	rep(i,3){
		while(x[i]&&tmp[i]<=t){
			x[i]--;
			t-=tmp[i];
		}
	}
	if(t==0){
		ret=max(ret,foo(x[0]+c[0],x[1]+c[1],x[2]+c[2])+1);
	}
	return dp[aa][bb][cc]=ret;
}
void mainmain(){
	vint a(3);
	rep(i,3) cin>>a[i];
	cin>>db;
	rep(i,3) cin>>b[i];
	cin>>dc;
	rep(i,3) cin>>c[i];
	// int aa[100];
	// fill_n(aa,100,-1);
	// fill_n(dp,11*101*10001,-1);
	rep(i,11) rep(j,101) rep(k,10001) dp[i][j][k]=-1;
	int ans=foo(a[0],a[1],a[2]);
	cout<<ans<<endl;
}


main() try{
    mainmain();
}
catch(...){
}