#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

inline ll rd() {
    ll x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

int testcase;

inline void work() {
    printf("Case #%d: ", ++testcase);
    ll n = rd(), m = rd(), k = rd();
    if (k == 1) {printf("%lld\n", m); return;}
    ll nn = n - m + 1;
    ll ans = (k - 1) % nn + 1;
    while (nn < n) {
        ll num = min(n - nn, (nn - ans) / (k - 1));
        ans += num * k;
        nn += num;
        if (nn == n) break;
        ++nn;
        ans = (ans + k - 1) % nn + 1;
    }
    printf("%lld\n", ans);
}

int main() {
    per(t, rd(), 1) work();
    return 0;
}