#include <bits/stdc++.h>
#define int __int128
#define ll long long
#define inf 0x3f3f3f3f
#define N 1020000
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int mo=998244353;
inline int read(){
	int x=0,w=0;char ch=getchar();
	while (!isdigit(ch))w|=ch=='-',ch=getchar();
	while (isdigit(ch))x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	return w?-x:x;
}

void solve(ll T){
	int n=read(),m=read(),k=read();
	int w=k*m;
	while (w>n){
		w=(w-n-1)/(k-1)+w-n;
	}
	ll ans=w;
	printf("Case #%lld: %lld\n",T,ans);
}
signed main(){
    int T=read();
    for (int _=1;_<=T;++_)solve(_);
    return 0;
}