#include <iostream>
#include <cassert>
#include <cstdio>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <stack>
#include <list>
using namespace std;
typedef long long li;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;

#define mp make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
li solve();

int main() {
    FILE* x = freopen("input", "r", stdin);
#ifdef DEBUG

    clock_t start = clock();
#else
    x = freopen("output", "w", stdout);
#endif
    (void)x;
    ios_base::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    string s;
    getline(cin,s );
    for(int i = 1; i <= t; ++i){
        cout << "Case #" << i << ": " << solve() << '\n';
    }

#ifdef DEBUG
    cout << "\n\n\nTime:" << ((clock() - start) / 1.0 / CLOCKS_PER_SEC);
#endif
    return 0;
}


li solve(){
    li n, k;
    int p;
    cin >> n >>k >>p;
    li add = n % k;
    if(!add)
        add += k;

    if(p == 100)
        return (n - add) / k + 1;
    while(true){
        // find min t: kt / kt + add >= p / 100
        li t =  (p * add + (100 - p) * k - 1) / ((100 - p) * k);
        if(k * t + add > n)
            break;
        add += k * t;

        //cerr << add << endl;
    }

    return (n - add) / k + 1;
}


/*
li solve(){
    li n, k;
    int p;
    cin >> n >> k >> p;
    li with = 0;
    li lastStop = n % k;
    for(li i = n % k + k; i <= n; i += k){
        if((k + with) * 100 >= i * p){
            with = 0;
            lastStop = i;
            cerr << lastStop << endl;
        }
        else
            with += k;
    }
    return (n - lastStop) / k + 1;
}
 *
 * */