#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define endl '\n' #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end()) typedef long long ll; typedef long double ld; typedef pair P; typedef tuple T; typedef complex comp; typedef vector< vector > matrix; struct pairhash { public: template size_t operator()(const pair &x) const { size_t seed = hash()(x.first); return hash()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2); } }; const int inf = 1e9 + 9; const ll mod = 1e9 + 7; const double eps = 1e-8; const double pi = acos(-1); int a[3], b[2][3]; int d[2]; int r[3]; int v[3] = {1000, 100, 1}; map memo; int calc(T t) { if (memo.count(t) == 0){ int c[3] ={get<0>(t), get<1>(t), get<2>(t)}; int res = 0; int D; for (int i = 0; i < 2; i++) { D = d[i]; for (int j = 0; j < 2; j++) { r[j] = 0; while (D > 0 && D >= v[j] && c[j] >= r[j]+1) { r[j]++; D -= v[j]; } } if (D <= c[2]) { res = max(res, 1+calc(make_tuple(c[0]-r[0]+b[i][0], c[1]-r[1]+b[i][1], c[2]-D+b[i][2]))); } } memo[t] = res; } return memo[t]; } int solve() { return calc(make_tuple(a[0], a[1], a[2])); } void input() { for (int i = 0; i < 3; i++) cin >> a[i]; cin >> d[0]; for (int i = 0; i < 3; i++) cin >> b[0][i]; cin >> d[1]; for (int i = 0; i < 3; i++) cin >> b[1][i]; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); input(); cout << solve() << endl; }