Title: Tax Rate Changed

VAT (value-added tax) is a tax imposed at a certain rate proportional to the sale price. Our store uses rules to calculate after-tax prices. When the VAT rate is x%, for an item with the before-tax price of p yen, its after-tax price is p (100+x) / 100 yen, rounded off. The total after-tax price of multiple items paid at once is the sum of after-tax prices of the items.

The VAT rate changes often. Our accountant has noticed that different pairs of items with the same total after-tax price may have different total after-tax prices after VAT rate changes. For example, when the VAT rate rises from 5% to 8%, a pair of items that had a total after-tax price of 105 yen before can now have after-tax prices of 107, 108, or 109 yen.

The task is to write a program that calculates the possible maximum total after-tax price of two items with the new VAT rate, knowing their total after-tax price before the VAT rate change.

Input:
The input consists of multiple datasets. Each dataset is in one line, consisting of three integers x, y, and s separated by a space. x is the VAT rate in percent before the VAT-rate change, y is the VAT rate in percent after the VAT-rate change, and s is the sum of after-tax prices of two items before the VAT-rate change. The end of the input is specified by three zeros separated by a space.

Output:
For each dataset, output in a line the possible maximum total after-tax price when the VAT rate is changed to y%.

Sample Input:
5 8 105
8 5 105
1 2 24
... (other input lines)

Sample Output:
109
103
24
... (other output lines)

Hints:
The table provides an instance of a before-tax price pair that has the maximum after-tax price after the VAT-rate change for each dataset of the sample input.

# Buggy version:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

while True:
    x,y,s = map(int,input().split())
    if (x,y,s) == (0,0,0):
        break
    ans = 0
    for i in range(1,s):
        for j in range(1,s-i):
            if i*(100+x)//100 + j*(100+x)//100== s:
                ans = max(ans,i*(100+y)//100 + j*(100+y)//100)
    print(ans)

# Fixed version:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

while True:
    x,y,s = map(int,input().split())
    if (x,y,s) == (0,0,0):
        break
    ans = 0
    for i in range(1,s//2 + 1):
        for j in range(1,s-i + 1):
            if i*(100+x)//100 + j*(100+x)//100== s:
                ans = max(ans,i*(100+y)//100 + j*(100+y)//100)
    print(ans)

# Buggy version:
while True:
    a,b,c = map(int, input().strip().split(' '))
    temp = 0
    if a == 0 and b == 0 and c == 0:
        break
    for i in range(1, 1001):
        for j in range(1, 1001):
            if i*(100+a)//100 + j*(100+a)//100 == c:
                if temp < i*(100+b)//100 + j*(100+b)//100:
                    temp = i*(100+b)//100 + j*(100+b)//100
    print(temp)



# Fixed version:
while True:
    a,b,c = map(int, input().strip().split(' '))
    temp = 0
    if a == 0 and b == 0 and c == 0:
        break
    for i in range(1, c):
        for j in range(i, c):
            if i*(100+a)//100 + j*(100+a)//100 == c:
                if temp < i*(100+b)//100 + j*(100+b)//100:
                    temp = i*(100+b)//100 + j*(100+b)//100
    print(temp)