#include <iostream>
using namespace std;
int main() {
double x;
double y;
double z;
cin>>x;
cin>>y;
cin>>z;
double a=z/x;
double d=y/x;
int b=y*a;
double c=b/z;
int i=0;
while(i!=1){
if(c<d){
  i=1;
}else{
  b--;
  c=b/z;
}
}
cout<<b;
}
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
//#include <random>
#include <map>
//#include <unordered_map>
#include <cstdlib>
#include <functional>
#include <time.h>
//#include <chrono>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream> // std::stringstream
#include <bitset>  // std::bitset<N>
//#include <type_traits>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define RFOR(i,a,b) for(int i=b-1;i>=a;i--)
#define ll long long
#define INF 1000000001
#define MOD 1000000007
#define SORT(s) sort(s.begin(), s.end());
#define REVERSE(s) reverse(s.begin(), s.end());
#define SUM(s) accumulate(s.begin(), s.end(), 0LL);
#define P pair<int,int>
#define mp make_pair
#define valid(x,y,h,w) (0<=x&&x<h&&0<=y&&y<w)
//#define int ll
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
int ndx[8] = { 0,1,0,-1, 1,1,-1,-1 };
int ndy[8] = { 1,0,-1,0, 1,-1,-1,1 };
double pi = 3.141592653589793;
using namespace std;
int POW(int x, int y) { return int(pow(double(x), double(y))); }
double log(double a, double b) { return log(b) / log(a); }

ll m;
string x;
int s;

ll binary_search_f(ll n) {
	ll res = 0;
	ll a = 1;;
	rrep(i, s) {
		if (i != s - 1) a *= n;
		if (a > 1000000000000000001 || res > 1000000000000000001) {
			return 1000000000000000001;
		}
		if (x[i] - '0' == 0) {
			continue;
		}
		if (a > 1000000000000000001 / (x[i] - '0')) {
			return 1000000000000000001;
		}
		ll res0 = res;
		res += (x[i] - '0') * a;
		if (res < 0 || res - (x[i] - '0') * a != res0) {
			return 1000000000000000001;
		}
	}
	return res;
}


int main() {

	int x, y, z;
	cin >> x >> y >> z;
	y *= z;
	if (y % x == 0) {
		cout << y / x - 1 << endl;
	}
	else {
		cout << y / x  << endl;
	}

}


