#include <bits/stdc++.h>
using namespace std;
#define maxn 200005
#define int long long 
int a[maxn],b[maxn];
int n,m;

bool check(int k){
    priority_queue<int>pq;
    for(int i=1;i<=n;i++){
        pq.push(a[i]*k);
    }
    for(int i=m-1;i>=0;i--){
        int cnt=b[i];
        int tmp=(1<<i);
        while(pq.size()&&pq.top()>=tmp&&cnt>0){
            int now=pq.top();
            pq.pop();
            int mm=min(now/tmp,cnt);
            now-=mm*tmp;
            cnt-=mm;
            if(now>0)pq.push(now);
        }
        while(pq.size()&&cnt--){
            pq.pop();
        }
    }
    return pq.empty();
}

void solve(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=0;i<m;i++){
        cin>>b[i];
    }
    int l=1,r=1e9;
    while(l<=r){
        int mid=l+r>>1;
        if(check(mid)){
            l=mid+1;
        }
        else{
            r=mid-1;
        }
    }
    cout<<l-1<<'\n';

    
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TT=1;cin>>TT;
    while(TT--){
        solve();
    }
}