#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

int T, n;
long long m, a[25];
long long ans = 0;

void dfs(int k, int num, long long sum){
	if (k == n){
		if (num == 0) return;
		// printf("%d %d %lld;;;\n", k , num, sum);
		if (num & 1) ans += (m / sum);
		else ans -= (m / sum);
		return;
	}
	dfs(k + 1, num, sum);
	long long cur = a[k] * sum / __gcd(a[k], sum);
	if (cur > m) return;
	dfs(k + 1, num + 1, cur);
}

int main(){
#ifndef ONLINE_JUDGE
    freopen("../data.in","r",stdin);
    freopen("../data.out","w",stdout);
#endif

	scanf("%d", &T);
	while (T --){
		scanf("%d %lld", &n, &m);
		ans = 0;
		for (int i = 0; i < n; i ++){
			scanf("%lld", &a[i]);
		}
		dfs(0, 0, 1);
		printf("%lld\n", m - ans);
	}

    return 0;
}