#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define N 300000
#define M 50
#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,dp[N+1][M+1];
long long C(long long x,int y)
{
    if (x<y) return 0;
    if (!y) return 1;
    else if (y==1) return min(x,n+1);
    else if (y==2) return min((long long)(((__int128)(x)*(x-1))>>1),n+1);
    else return min(dp[x-y][y],n+1);
}
long long calc(long long l,long long r,int d)
{
    if (!d) return min(r-l+1,n+1);
    else if (d==1) return min(((__int128)(r+1)*(r+2)>>1)-((__int128)(l)*(l+1)>>1),(__int128)(n+1));
    else
    {
	double res=1;
	long long rst=0;
	for (int i=1;i<=d;++i)
	{
	    res=res*(r-i+1)/i;
	    if (res>=(long long)(inf)) return n+1;
	}
	for (int i=r;i>=l;--i)
	{
	    rst=min(rst+C(i+d,d),n+1);
	    if (rst==n+1) return n+1;
	}
	return rst;
    }
}
long long F(long long x)
{
    if (x/B>=50) return n+1;
    long long d,c,l,sl,sr,res=0,rst;
    for (int i=0;i<=49;++i)
	if (i*B<=x)
	{
	    d=x-i*B,l=max(d-(B-1),0ll),sl=(l+A-1)/A,sr=d/A;
	    if (sl<=sr) res=min(res+calc(sl,sr,i),n+1);
	}
    return res;
}
int main()
{
    long long res;
    dp[0][0]=1;
    for (int i=0;i<=N;++i)
	for (int j=0;j<=M;++j)
	{
	    if (i) dp[i][j]=min(dp[i][j]+dp[i-1][j],(long long)(inf));
	    if (j) dp[i][j]=min(dp[i][j]+dp[i][j-1],(long long)(inf));
	}
    T=read();
    for (int qt=1;qt<=T;++qt)
    {
	n=read(),A=read(),B=read(),res=-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;
}