#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll P, Q, A; cin >> P >> Q >> A;
	if (A == 0) {
		if (P < Q) {
			ll s = 0;
			for (ll i = 1; i < 100000; i++) {
				ll pc = (100 + P) * i / 100;
				ll qc = (100 + Q) * i / 100;
				if (pc >= qc) s++;
			}
			cout << mod - 7 - s << endl;
		}
		else puts("0");
	}
	else {
		if (P <= Q) cout << mod - 7 << endl;
		else {
			ll l = 0;
			ll r = mod - 6;
			while (r - l > 1) {
				ll mid = (l + r) >> 1;
				long double pc = (long double)(100 + P) * mid / 100;
				long double qc = (long double)(100 + Q) * mid / 100 + A;
				if (pc < qc + 1e-7) l = mid;
				else r = mid;
			}
			ll res = 0;
			for (ll i = 1; i <= l; i++) {
				ll pc = (100 + P) * i / 100;
				ll qc = (100 + Q) * i / 100 + A;
				if (pc < qc) res++;
			}
			cout << res << endl;
		}

	}
	return 0;
}