#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

const int coin[] = {1000, 100, 1};

bool check(const vector<int>& a, int d)
{
    for(int i=0; i<3; ++i){
        int x = min(a[i], d / coin[i]);
        d -= x * coin[i];
    }
    return d == 0;
}

void sub(vector<int>& a, int d)
{
    for(int i=0; i<3; ++i){
        int x = min(a[i], d / coin[i]);
        d -= x * coin[i];
        a[i] -= x;
    }
}

void add(vector<int>& a, const vector<int>& b)
{
    for(int i=0; i<3; ++i)
        a[i] += b[i];
}

int main()
{
    vector<int> init(3);
    for(int i=0; i<3; ++i)
        cin >> init[i];

    vector<int> value(2);
    vector<vector<int> > receive(2, vector<int>(3));
    for(int i=0; i<2; ++i){
        cin >> value[i];
        for(int j=0; j<3; ++j)
            cin >> receive[i][j];
    }

    vector<vector<int> > dp(11, vector<int>(101, -1));
    dp[init[0]][init[1]] = init[2];
    int ans = 0;
    for(;;){
        vector<vector<int> > nextDp(11, vector<int>(101, -1));
        bool ok = false;
        for(int i=0; i<=10; ++i){
            for(int j=0; j<=100; ++j){
                for(int a=0; a<2; ++a){
                    vector<int> v = {i, j, dp[i][j]};
                    if(check(v, value[a])){
                        sub(v, value[a]);
                        add(v, receive[a]);
                        nextDp[v[0]][v[1]] = max(nextDp[v[0]][v[1]], v[2]);
                        ok = true;
                    }
                }
            }
        }

        if(!ok){
            cout << ans << endl;
            return 0;
        }
        dp.swap(nextDp);
        ++ ans;
    }
}