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

int compare_int(const void *a,const void *b){
	return *(int*)a - *(int*)b;
}

int main(void){
	int x,y;
	int s_in;
	double ss_in;
	int i;
	int count = 0;
	double ans[1000];
	double f,iptr;
	int rans[1000];
	while(scanf("%d %d %d",&x,&y,&s_in)){
		if(x == 0 && y == 0 && s_in == 0){
			break;
		}
		ss_in = (double)s_in;
		for(i = 1;i < s_in ; i++){
			ans[i] = ((i * (100 + y)) / (100 + x)) + (((ss_in - i) * (100 + y)) / (100 + x));
			f = modf(ans[i],&iptr);
			if(f == 0.0){
				ans[i] = ans[i] + 1.0;
			}
			rans[i] = ans[i];
			count++;
		}
		qsort(rans,count,sizeof(int),compare_int);
		printf("%d\n",rans[count - 1]);
		count = 0;
	}
	return 0;
}