#include <iostream> #include <vector> using namespace std; int a, b, c, d; int x, y, z; int main(){ int n, m; while(cin >> n >> m){ cin >> a >> b >> c >> d; cin >> x >> y >> z; vector<vector<int> > dp(n + 1, vector<int>(m + 1, 0)); for(int i = 0; i <= n; ++i){ for(int j = 0; j <= m; ++j){ if(i >= a && j >= b) dp[i][j] = max(dp[i][j], dp[i - a][j - b] + x); if(i >= d){ dp[i][j] = max(dp[i][j], dp[i - d][j] + z); } if(j >= c){ dp[i][j] = max(dp[i][j], dp[i][j - c] + y); } } } cout << dp[n][m] << endl; } return 0; }