#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;
	double i2;
	int count = 0;
	double a,b;
	double c,d;
	int ans[1000];
	double f,iptr;
	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++){
			i2 = (double)i;
			a = 100 * i2 / (100 + x);
			f = modf(a,&iptr);
			if(f != 0.0){
				a = a - f + 1.0;
			}
			b = 100 * (ss_in - i2) / (100 + x);
			f = modf(b,&iptr);
			if(f != 0.0){
				b = b - f + 1.0;
			}
			c = a * (100 + y) / 100;
			f = modf(c,&iptr);
			if(f != 0.0){
				c -= f;
			}
			d = b * (100 + y) / 100;
			f = modf(d,&iptr);
			if(f != 0.0){
				d -= f;
			}
			ans[i] = (int)(c + d);
			count++;
		}
		qsort(ans,count,sizeof(int),compare_int);
		printf("%d\n",ans[count]);
		count = 0;
	}
	return 0;
}