#include <iostream>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstring>

using namespace std;

#define FOR(x,y) for(int x = 0;x < (y);x++)
#define LLI long long int
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())

#define _L(x) cout<<(x)<<endl
//#define _L(x) ;

template<int um> class UF {
public:
    vector<int> _parent,_rank;
    UF()
    {
        _parent=_rank=vector<int>(um,0);
        for(int i=0;i<um;i++)
        {
            _parent[i]=i;
        }
    }
    
    int Find(int x)
    {
        if(_parent[x] == x)
        {
            return x;
        }
        _parent[x] = Find(_parent[x]);
        return _parent[x];
    }
    
    int Union(int x,int y)
    {
        int xRoot = Find(x);
        int yRoot = Find(y);
        if(_rank[xRoot]>_rank[yRoot])
        {
            _parent[xRoot] = yRoot;
           return yRoot;
        }
        if(_rank[xRoot]<_rank[yRoot])
        {
            _parent[yRoot] = xRoot;
            return xRoot;
        }
        if(xRoot != yRoot)
        {
            _parent[yRoot] = xRoot;
            _rank[xRoot]++;
            return xRoot;
        }
        return xRoot;
    }
};

int dp[11][101][10001];
int A1000, A100, A1;
int Db;
int B1000, B100, B1;
int Dc;
int C1000, C100, C1;

int calculate(int a, int b, int c)
{
    if(dp[a][b][c] >= 0)
    {
        return dp[a][b][c];
    }
    int maxValue = 0;
    FOR(i, a+1) FOR(j, b + 1)
    {
        int restB = Db - i * 1000 - j * 100;
        if(restB >= 0 && restB <= c)
        {
            maxValue = max(maxValue, calculate(a - i + B1000, b - j + B100, c - restB + B1) + 1);
        }
        int restC = Dc - i * 1000 - j * 100;
        if(restC >= 0 && restC <= c)
        {
            maxValue = max(maxValue, calculate(a - i + C1000, b - j + C100, c - restC + C1) + 1);
        }
    }
    return maxValue;
}

int main() {
    
    cin >> A1000 >> A100>> A1;
    cin >> Db;
    cin >> B1000 >> B100>> B1;
    cin >> Dc;
    cin >> C1000 >> C100>> C1;

    FOR(i, 11) FOR(j, 101) FOR(k, 10001)
    {
        dp[i][j][k] = -1;
    }
    
    cout << calculate(A1000, A100, A1) << endl;
    return 0;
}