#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
long long n,m,ans,T,f,a[21],k;
long long FastReadLongLong()
{
	long long x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')
		{
			f=-1;
		}
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=(x<<1)+(x<<3)+(c^48),c=getchar();
	}
	return x*f;
}
long long QuickPow(long long a,long long b)
{
	long long res=1;
	while(b)
	{
		if(b&1)
		{
			res=res*a;
		}
		a=a*a;
		b>>=1;
	}
	return res;
}
void dfs(long long s,long long pos,long long x)
{
	if(!s)
	{
		k+=(m/x);
		return;
	}
	for(int i=pos;i<=n;i++)
	{
		if(!x)
		{
			dfs(s-1,i+1,a[i]);
		}
		else
		{
			dfs(s-1,i+1,a[i]/__gcd(x,a[i])*x);
		}
	}
}
int main(){
	T=FastReadLongLong();
	for(int z=1;z<=T;z++)
	{
		n=FastReadLongLong(),m=FastReadLongLong();
		for(int i=1;i<=n;i++)
		{
			a[i]=FastReadLongLong();
		}
		ans=0;
		for(int i=0;i<n;i++)
		{
			k=0;
			dfs(i+1,1,0);
			ans+=QuickPow(-1,i)*k;
		}
		printf("%lld\n",m-ans);
	}	
	return 0;
}