#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; void solve() { int a, b, c; ll x, y, z, w; cin >> a >> b >> c >> x >> y >> z >> w; ll ans = 0; for (int d = 0; d <= a && d <= b; ++d) { // イチゴ味: A - D 個 Z 円 // メロン味: B - D 個 Y 円 // 3色: D 個 W - X 円 array, 3> v{make_pair(z, a - d), make_pair(y, b - d), make_pair(w - x, d)}; ranges::sort(v, greater{}, &pair::first); ll sale = x * d; int rem = c; for (const auto& [price, num] : v) { if (price > 0) { const int use = min(num, rem); sale += price * use; rem -= use; } } chmax(ans, sale); } cout << ans << '\n'; } int main() { int t; cin >> t; while (t--) solve(); return 0; }