#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i =0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;

const int INF = 1001001001;
int main(){
 int X,Y,Z;
 cin >>X>>Y>>Z;
 int tmp=Y*Z;
 if(tmp%X==0)cout <<tmp/X-1;
 else cout <<tmp/X;
}
#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;

typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<string, int> psi;
typedef pair<char, int> pci;
typedef pair<int, char> pic;
const int MOD = 1e9 + 7;
const long double PI = 3.141592653589793238462643383279502884197;

ll fac[1] = {1}, inv[1] = {1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll mp(ll a,ll b){ll ret=1;while(b){if(b&1)ret=ret*a%MOD;a=a*a%MOD;b>>=1;}return ret;}
ll cmb(ll r, ll c) {return (c>r||c<0) ? 0:fac[r] * inv[c] % MOD * inv[r - c] % MOD;}

int main() {
    ll x,y,z;
    scanf("%lld %lld %lld", &x, &y, &z);

    ll mav = 0;
    for (int i = 1; i <= 10000000; i++) {
        // y/x > t/z
        // x*t > z*y;
        if (y*z > i*x) mav = max(mav, (ll)i);
    }

    printf("%lld", mav);
}

// author: rdd6584
