1 #include <bits/stdc++.h>
 2 using namespace std;
 3 #define ll long long
 4 #define ull unsigned long long
 5 #define mst(a,b) memset((a),(b),sizeof(a))
 6 #define mp(a,b) make_pair(a,b)
 7 #define pi acos(-1)
 8 #define pii pair<int,int>
 9 #define pb push_back
10 const int INF = 0x3f3f3f3f;
11 const double eps = 1e-6;
12 const int MAXN = 2e6 + 10;
13 const int MAXM = 1e8 + 10;
14 const ll mod = 1e9 + 7;
15
16 ll f[MAXN];
17
18 int main() {
19 #ifdef local
20     freopen("data.txt", "r", stdin);
21 //    freopen("data.txt", "w", stdout);
22 #endif
23     int cas = 1;
24     int t;
25     scanf("%d",&t);
26     while(t--) {
27         ll n,m,k;
28         scanf("%lld%lld%lld",&n,&m,&k);
29         printf("Case #%d: ",cas++);
30         if(m <= k) {
31             f[1] = k % (n - m + 1);
32             if(f[1] == 0) f[1] = n - m + 1;
33             for(ll i = 2; i <= m; i++)
34                 f[i] = (f[i - 1] + k - 1) % (n - m + i) + 1;
35             printf("%lld\n",f[m]);
36         } else {
37             if(k == 1) printf("%lld\n",m);
38             else {
39                 ll a = n - m + 1, b = 1;
40                 ll c = k % a, x = 0;
41                 if(c == 0) c = a;
42                 while(b + x <= m) {
43                     a += x, b += x, c += k * x;
44                     c %= a;
45                     if(c == 0) c = a;
46                     x = (a - c) / (k - 1) + 1;
47                 }
48                 c += (m - b) * k;
49                 c %= n;
50                 if(c == 0) c = n;
51                 printf("%lld\n",c);
52             }
53         }
54     }
55     return 0;
56 }