#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll maxr=1e16;
int n,k,a[50010],b[30];
int cnt,book[50010];
int c[20][50010];
ll ans,p[50010];
bool check(ll x)
{
	int i,j,las,vis;
	ll sum=0;
	for(i=1;i<=n;++i)
		p[i]=x*a[i],book[i]=1;
	for(i=1;i<=n;++i)
		sum+=(p[i]/(1<<k));
	cnt=0;
	for(i=1;i<=n;++i)
	{
		if(p[i]&1)
			c[0][++cnt]=i;
	}
	for(i=1;i<=n;++i)
	{
		if(!(p[i]&1))
			c[0][++cnt]=i;
	}
	for(i=1;i<k;++i)
	{
		cnt=0;
		for(j=1;j<=n;++j)
		{
			if(p[c[i-1][j]]&(1<<i))
				c[i][++cnt]=c[i-1][j];
		}
		for(j=1;j<=n;++j)
		{
			if(!(p[c[i-1][j]]&(1<<i)))
				c[i][++cnt]=c[i-1][j];
		}
	}
	//printf("??? %lld %lld\n",x,sum);
	for(i=k-1;i>=0;--i)
	{
		sum<<=1;
		for(j=1;j<=n;++j)
		{
			if(book[j])
				sum+=((p[j]&(1<<i))?1:0);
		}
		//if(x==5)
			//printf("!!! %lld %lld %lld\n",sum,i,b[i]);
		if(sum<b[i])
		{
			if(!i)
				return 1;
			las=b[i]-sum;
			sum=0;
			vis=0;
			for(j=1;j<=n;++j)
			{
				if(book[c[i-1][j]])
				{
					--las,book[c[i-1][j]]=0;
					if(!las)
					{
						vis=1;
						break;
					}
				}
			}
			if(!vis)
				return 1;
		}
		else
			sum-=b[i];
	}
	return (!sum);
}
int main()
{
	int i,T;
	ll l,r,mid,suma;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d %d",&n,&k);
		suma=0;
		for(i=1;i<=n;++i)
		{
			scanf("%d",&a[i]);
			suma+=a[i];
		}
		for(i=0;i<k;++i)
			scanf("%d",&b[i]);
		ans=0,l=1,r=maxr/suma;
		while(l<=r)
		{
			mid=(l+r)>>1;
			if(check(mid))
				ans=mid,l=mid+1;
			else
				r=mid-1;
		}
		printf("%lld\n",ans);
	}
	return 0;
}