#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define N 400000
#define inf 1e18
using namespace std;
long long read()
{
    char c=0;
    long long sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int T,length;
long long n,A,B,st[N+1],dp[N+1];
long long F(long long x)
{
    int ps=lower_bound(st+1,st+length+1,x+1)-st-1;
    long long maxn=0,c1,c2;
    if (ps) maxn=max(maxn,dp[ps]);
    maxn=max(maxn,x/A+1);
    if (x>=B)
    {
	c1=(x-B)/A,c2=x/A;
	maxn=max(maxn,(long long)(min((__int128)(c1+1)*(c1+2)/2+c2-c1,(__int128)(n+1))));
    }
    return min(maxn,n+1);
}
int main()
{
    long long res;
    T=read();
    for (int qt=1;qt<=T;++qt)
    {
	n=read(),A=read(),B=read(),length=0,res=-1;
	for (int i=2;i<=49;++i)
	{
	    if (i==2)
	    {
		for (int j=0;j<=200000;++j) st[++length]=j*A+i*B;
	    }
	    else if (i==3)
	    {
		for (int j=0;j<=20000;++j) st[++length]=j*A+i*B;
	    }
	    else if (i==4)
	    {
		for (int j=0;j<=2000;++j) st[++length]=j*A+i*B;
	    }
	    else
	    {
		for (int j=0;j<=400;++j) st[++length]=j*A+i*B;
	    }
	}
	sort(st+1,st+length+1),length=unique(st+1,st+length+1)-st-1;
	for (int i=1;i<=length;++i)
	{
	    dp[i]=0;
	    if (st[i]>=A) dp[i]=max(dp[i],min(F(st[i]-A)+1,n+1));
	    if (st[i]>=B) dp[i]=max(dp[i],min(F(st[i]-A)+F(st[i]-B),n+1));
	}
	for (int i=log(inf)/log(2);i>=0;--i)
	    if (res+(1ll<<i)<=inf&&F(res+(1ll<<i))<n)
		res+=(1ll<<i);
	res++,printf("Case #%d: %lld\n",qt,res);
    }
    return 0;
}