#pragma region GNUC
//以下を参考にした
//https://yukicoder.me/wiki/auto_vectorization
#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif
#pragma endregion

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
//#include <array>//x C++ (G++ 4.6.4)

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <cassert>//assert();
#include <fstream>
#include <random>
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)

/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#define PII pair<int,int>
/////////
using namespace::std;

// 最大公約数
template<class T>
inline T gcd(T a, T b){return b ? gcd(b, a % b) : a;}
//inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}

// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a / gcd(a, b) * b;}
//inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////
struct mon{
	int A,B,C;
};
bool operator<(mon m1,mon m2){
	if( m1.A<m2.A)return true;
	else if(m1.A>m2.A)return false;

	if( m1.B<m2.B)return true;
	else if(m1.B>m2.B)return false;

	if( m1.C<m2.C)return true;
	else if(m1.C>m2.C)return false;
	return false;
}
int eval(mon m){
	return m.A*1000+m.B*100+m.C;
}
mon pay(mon m,int D){
	mon ret;
	int temp = min(m.A,D/1000);
	if( temp < 0 ){
		mon ans={-1,-1,1};
		return ans;
	}
	ret.A = m.A - temp;
	D -= 1000*temp;

	temp = min(m.B,D/100);
	if( temp < 0 ){
		mon ans={-1,-1,1};
		return ans;
	}
	ret.B = m.B - temp;
	D -= 100 * temp;
	
	if( m.C < D ){
		mon ans={-1,-1,1};
		return ans;
	}
	ret.C = m.C - D;
	return ret;
}
void solve(){
	set<mon> que,nextQue;
	mon start;
	cin >> start.A >> start.B >> start.C;
	int D[2];
	mon P[2];
	for(int i=0;i<2;++i){
		cin >> D[i];
		cin >> P[i].A >> P[i].B >> P[i].C;
	}
	int count = -1;
	nextQue.insert(start);
	do{
		++count;
		que = nextQue;
		nextQue.clear();
		set<mon>::iterator itr,end;
		itr = que.begin();
		end = que.end();
		for(;itr!=end;++itr){
			mon now = *itr;
			for(int i=0;i<2;++i){
				if( eval(now) < D[i] ) continue;
				mon next = pay(now,D[i]);
				if( next.A < 0 || next.B < 0 || next.C < 0) continue;
				next.A += P[i].A;
				next.B += P[i].B;
				next.C += P[i].C;
				nextQue.insert(next);
			}
		}
	}while(nextQue.size());
	cout << count << endl;
}

signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	//std::cout << std::fixed;//小数を10進数表示
	//cout << setprecision(16);//小数点以下の桁数を指定
	
	solve();
}