# include <bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int N=1e8;
constexpr ll INF=1e18;
int prime[10000010],m=0,tot;
ll a[10010],ri[10010],P[20],C[20];
bool npri[100000010];
inline void chkmin(ll &x,const ll &y){x=min(x,y);}
ll dfs(int d,ll cur,ll le)
{
	if(d>tot) return cur>=le?cur:INF;
	ll ans=dfs(d+1,cur,le);
	for(int i=1;i<=C[d];i++) chkmin(ans,dfs(d+1,cur*=P[d],le));
	return ans;
}
ll calc(ll n,ll le)
{
	tot=0;
	for(int i=1;i<=m && prime[i]*prime[i]<=n;i++)
		if(n%prime[i]==0)
		{
			P[++tot]=prime[i];C[tot]=0;
			for(;n%P[tot]==0;n/=P[tot]) C[tot]++;
		}
	if(n>1) P[++tot]=n,C[tot]=1;
	return dfs(1,1,le);
}
int main()
{
	int T,n;
	ll L,R;
	npri[1]=1;
	for(int i=2;i<=N;i++)
	{
		if(!npri[i]) prime[++m]=i;
		for(int j=1;j<=m && i*prime[j]<=N;j++)
		{
			npri[i*prime[j]]=1;
			if(i%prime[j]==0) break;
		}
	}
	cin>>T;
	for(int _=1;_<=T;_++)
	{
		ll ans=INF;
		scanf("%d%lld%lld",&n,&L,&R);
		for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
		sort(a+1,a+n+1);
		for(int i=n;i;i--) ri[i]=__gcd(ri[i+1],a[i]);
		ll le=1;
		if(ri[1]>=L) chkmin(ans,calc(ri[1],L));
		for(int i=1;i<=n;i++)
		{
			ll t=__gcd(le,a[i]);
			if(le/t>R/a[i]) break;
			le=le/t*a[i];
			if(i<n)
			{
				if(le>ri[i+1] || ri[i+1]%le || ri[i+1]<L) continue;
				else if(le<L) chkmin(ans,le*calc(ri[i+1]/le,(L+le-1)/le));
				else chkmin(ans,le);
			}
			else chkmin(ans,(L+le-1)/le*le);
		}
		if(ans<=R) printf("Case #%d: %lld\n",_,ans);
		else printf("Case #%d: NO\n",_);
		memset(ri+1,0,sizeof(ll)*n);
	}
	return 0;
}