#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

int test_id ;


ll ksmall ( ll n , ll m , ll k ) {
    ll taken = 0 , rem = n ;
    ll x = ( k % n ) ;
    if ( x == 0 ) { x = n ; }
    vector < ll > v ;
    ll ans = -1 ;
    while ( 1 ) {
        ll tot = 1 + ( rem - x ) / k ;
        if ( taken + tot >= m ) {
            ans = x + ( m - taken - 1 ) * k ;
            break ;
        }
        else {
            v.push_back ( x ) ;
            ll lst = x + ( tot - 1 ) * k ;
            x = k - ( rem - lst ) ;
            taken += tot , rem -= tot ;
            x %= rem ;
            if ( x == 0 ) { x = rem ; }
        }
    }
    reverse ( v.begin ( ) , v.end ( ) ) ;
    for ( auto st : v ) {
        if ( st <= ans ) {
            ll coef = 1 + ( ans - st ) / ( k - 1 ) ;
            ans += coef ;
        }
    }
    return ans ;
}

ll msmall ( ll n , ll m , ll k ) {
    ll ans = 0 ;
    for ( ll i = n - m + 1 ; i <= n ; ++ i ) {
        ll pos = k % i ;
        if ( pos == 0 ) { pos = i ; }
        ans = ans + pos ;
        if ( ans > i ) { ans -= i ; }
    }
    return ans ;
}

void test ( ) {
    for ( int i = 1 ; i <= 100 ; ++ i ) {
        for ( int j = 1 ; j <= i ; ++ j ) {
            for ( int t = 1 ; t <= 100 ; ++ t ) {
                if ( ksmall ( i , j , t ) != msmall ( i , j , t ) ) {
                    cout << i << " " << j << " " << t << " ---> " << ksmall ( i , j , t ) << " " << msmall ( i , j , t ) << "\n" ;
                    return ;
                }
            }
        }
    }
}


void solve ( ) {
    ll n , m , k ;
    cin >> n >> m >> k ;
    ++ test_id ;
    cout << "Case #" << test_id << ": " ;
    if ( k == 1 ) {
        cout << m << "\n" ;
        return ;
    }
    if ( k <= m ) {
        cout << ksmall ( n , m , k ) << "\n" ;
    }
    else {
        cout << msmall ( n , m , k ) << "\n" ;
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    // test ( ) ;
    // return 0 ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}