#include <bits/stdc++.h>

using i64 = long long;

void solve()
{
    int n, k;
    std::cin >> n >> k;
    std::vector<i64> a(n + 1), b(k);
    for(int i = 1; i <= n; ++i) {
        std::cin >> a[i];
    }
    i64 carri = 0;
    for(int i = 0; i < k; ++i) {
        std::cin >> b[i];
        carri += b[i] << i;
    }
    int mx = *std::ranges::max_element(a);
    i64 ans = *std::ranges::partition_point(std::ranges::iota_view(1ll, carri / mx + 1),
        [&](i64 x) -> bool {
            auto tb = b;
            std::priority_queue<i64> q;
            for(int i = 1; i <= n; ++i) {
                q.push(a[i] * x);
            }
            int cur = k - 1;
            while(!q.empty()) {
                i64 x = q.top(); q.pop();
                while(cur >= 0 && !tb[cur]) {
                    --cur;
                }
                if(cur < 0) {
                    return false;
                }
                --tb[cur];
                if(x > (1 << cur)) {
                    q.push(x - (1 << cur));
                }
            }
            return true;
        });
    std::cout << ans - 1 << '\n';
}

int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    std::cin >> T;
    while(T --) solve();
    return 0;
}