// yukicoder: No.158 奇妙なお使い
// 2019.7.19 bal4u

#include <stdio.h>
#include <string.h>

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

int dp[10002][12][102];
int b1000, b100, b1;

int enable(int a1000, int a100, int a1, int d) {
	if (d >= 1000 && a1000) {
		if (a1000 >= d/1000) a1000 -= d/1000, d %= 1000;
		else d -= a1000*1000, a1000 = 0;
	}
	if (d >= 100 && a100) {
		if (a100 >= d/100) a100 -= d/100, d %= 100;
		else d -= a100*100, a100 = 0;
	}
	if (a1 < d) return 0;
	b1000 = a1000, b100 = a100, b1 = a1 - d;
	return 1;
}
	
int main()
{
	int i, j, k, l, t, f;
	int	a[3], m[2][4];
	
	for (i = 0; i < 3; i++) a[i] = in();
	for (i = 0; i < 2; i++) for (j = 0; j < 4; j++) m[i][j] = in();
	
	memset(dp, -1, sizeof(dp));
	dp[0][a[0]][a[1]] = a[2], f = 1;
	for (i = 0; f; i++) {
		f = 0;
		for (j = 0; j <= 10; j++)  for (k = 0; k <= 100; k++) if ((t = dp[i][j][k]) >= 0) {
			for (l = 0; l < 2; l++) if (enable(j, k, t, m[l][0])) {
				int x = dp[i+1][b1000+m[l][1]][b100+m[l][2]];
				f = 1;
				if (x == 0 || x < b1+m[l][3]) dp[i+1][b1000+m[l][1]][b100+m[l][2]] = b1+m[l][3];
			}
		}
	}
	printf("%d\n", i-1);
	return 0;
}