#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long
using namespace std;
const LL INF=1e17;
LLL preC[60][1000005];int pos[60];
inline LL C2(const LL&n){return n*(n-1)/2;}
inline LL calc(LL l,LL r,int m){
    if(l>r)return 0;
    if(m==0)return r-l+1;
    if(m==1)return min((LLL)(l+r+2)*(r-l+1)/2,(LLL)INF);
    if(m==2){
        if(r>1e9)return INF;
        LL z=0;
        for(LL i=r;i>=l&&z<INF;--i)z+=C2(i+2);
        return z;
    }
    return r+m<pos[m]?min(preC[m][r+m]-preC[m][l+m-1],(LLL)INF):INF;
}
inline LL solve(LL k,LL a,LL b){
    LL ans=0;
    for(int x=0;x*b<=k&&ans<INF;++x)ans+=calc(max(0ll,k-x*b+a-b)/a,(k-x*b)/a,x);
    return ans;
}
inline void MAIN(){
    LL n,a,b,ans=-1;cin>>n>>a>>b;
    for(LL l=0,r=b*ceil(log2l(n));l<=r;){
        const LL mid=(l+r)>>1;
        if(solve(mid,a,b)>=n)ans=mid,r=mid-1;
        else l=mid+1;
    }
    cout<<ans<<'\n';
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    for(int m=3;m<60;++m)for(pos[m]=m;(preC[m][pos[m]]=(m>3?preC[m-1][pos[m]-1]:C2(pos[m]-1))+preC[m][pos[m]-1])<INF;++pos[m]);
    for(int m=3;m<60;++m)for(int i=m+1;i<pos[m];++i)preC[m][i]+=preC[m][i-1];
    int t=1;cin>>t;for(int _=1;t--;++_)cout<<"Case #"<<_<<": ",MAIN();
    return 0;
}
/*

*/