#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

int solution(int buckets, int minutesToDie, int minutesToTest) {
    if (buckets <= 1) {
        return 0;
    }
    
    // Calculate number of test rounds possible
    int tests = minutesToTest / minutesToDie;
    
    // Each pig can be in (tests + 1) states:
    // - Die after test 1, 2, 3, ..., tests
    // - Never die (survive all tests)
    int states = tests + 1;
    
    // We need minimum pigs such that states^pigs >= buckets
    if (states == 1) {
        return buckets - 1;
    }
    
    int pigs = 0;
    long long totalCombinations = 1;
    
    while (totalCombinations < buckets) {
        pigs++;
        totalCombinations *= states;
    }
    
    return pigs;
}

int main() {
    int buckets, minutesToDie, minutesToTest;
    scanf("%d", &buckets);
    scanf("%d", &minutesToDie);
    scanf("%d", &minutesToTest);
    
    int result = solution(buckets, minutesToDie, minutesToTest);
    printf("%d\n", result);
    return 0;
}