// Problem: A - Candy Store
// Contest: Virtual Judge - Training 20230624
// URL: https://vjudge.net/contest/564820#problem/A
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// start time: 2023-06-24 12:05:03

#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
using namespace std;
template<typename T>
inline bool cmax(T&x,const T& y){return x<y?x=y,1:0;}
template<typename T>
inline bool cmin(T&x,const T& y){return y<x?x=y,1:0;}
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vii; 
typedef unsigned long long ull;
#define sz(x) (int(x.size()))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define em emplace
#define X first
#define Y second
const int mod=998244353;
inline void MOD(int&x){x-=mod,x+=x>>31&mod;}
inline void MOD(ll& x){x-=mod,x+=x>>63&mod;}
inline int add(int x,int y){MOD(x+=y);return x;}
inline int mul(int x,int y){return 1ll*x*y%mod;}
template<typename ... A>inline int mul(const int& x,const A&... p){return 1ll*x*mul(p...)%mod;}
inline ll ksm(ll a,ll p=mod-2){ll ans=1;for(;p;p>>=1,a=a*a%mod)if(p&1)ans=ans*a%mod;return ans;}
typedef long double LD;
const int MAXN=2e5+10;
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);cout<<fixed<<setprecision(10);
	int T;cin>>T;
	for(int id=1;id<=T;id++)
	{
		int k;ll c;cin>>k>>c;
		ll sum=0;
		int ans=0;
		for(ll i=1;i<=c;i=sum/k+1)
		{
			ll dt=k-sum/i;
			sum+=dt*i,ans+=dt;
		}
		cout<<"Case #"<<id<<": ";
		cout<<ans<<'\n';
	}
	return 0;
}