#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

vector<vector<vector<int> > > m;
int A[3], B[2][3], C[2];
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  m.resize(11);
  FOR(i, 0, 11){
    int a = 1+(10000-i*1000)/100;
    m[i].resize(a);
    FOR(j, 0, a){
      int b = 1 + 10000 - i * 1000 - j * 100;
      m[i][j].resize(b);
    }
  }
  FOR(i, 0, 3)cin >> A[i];
  FOR(j, 0, 2){
    cin >> C[j];
    FOR(i, 0, 3)cin >> B[j][i];
  }
  FOR(i, 0, 10001)FOR(j, 0, 1+i/1000)FOR(k, 0, 1+(i-j*1000)/100){
    int l = i-j*1000-k*100;
    FOR(h, 0, 2){
      int c = C[h], a, b;
      a = min(c/1000, j);
      c -= a * 1000;
      b = min(c/100, k);
      c -= b * 100;
      if(l >= c) maxs(m[j][k][l], m[j-a+B[h][0]][k-b+B[h][1]][l-c+B[h][2]]+1);
    }
  }
  cout << m[A[0]][A[1]][A[2]] << endl;
  return 0;
}