#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int memo[11][110][10010];
int Cm,Bm;
int B[3];
int C[3];

bool calc(int *A, int *d, int m){
  //払えるか
  if (m <= 1000 * A[0]) {
    d[0] = m / 1000;
    m %= 1000;
  }else{
    d[0] = A[0];
    m -= 1000 * A[0];
  }
  if (m <= 100 * A[1]) {
    d[1] = m / 100;
    m %= 100;
  }else{
    d[1] = A[1];
    m -= 100 * A[1];
  }
  if (m <= A[2]) {
    d[2] = m;
  }else{
    return false;
  }
  return true;
}


int dp_go(int a1, int a2, int a3){
  if (memo[a1][a2][a3] >= 0) {
    return memo[a1][a2][a3];
  }
  //Bにいく
  int ret = 0;
  {
    int A[3] = {a1,a2,a3};
    int Bd[3];
    auto OK = calc(A,Bd,Bm);
    if (OK) {
      rep(i,3){
        A[i] -= Bd[i];
        A[i] += B[i];
      }
      ret = 1 + dp_go(A[0],A[1],A[2]);
    }
  }
  //Cにいく
  {
    int A[3] = {a1,a2,a3};
    int Cd[3];
    auto OK = calc(A,Cd,Cm);
    if (OK) {
      rep(i,3){
        A[i] -= Cd[i];
        A[i] += C[i];
      }
      ret = max(ret,1 + dp_go(A[0],A[1],A[2]));
    }
  }
  return memo[a1][a2][a3] = ret;
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  mem(memo,-1);
  int A[3];
  rep(i,3){
    cin >> A[i];
  }
  cin >> Bm;
  rep(i,3){
    cin >> B[i];
  }
  cin >> Cm;
  rep(i,3){
    cin >> C[i];
  }
  cout << dp_go(A[0],A[1],A[2]) << endl;
  return 0;
}