import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

void main() {
    while (true) {
        int x, y, s;
        scan(x, y, s);

        if (!x && !y && !s) return;

        solve(x, y, s);
    }
}

void solve(int x, int y, int s) {
    int ans;

    foreach (p ; 1 .. s) {
        int q = s - p;
        int pp = calckmax(p, x);
        int qq = calckmax(q, x);

        if (!pp || !qq) continue;

        int pz = calczei(pp, y);
        int qz = calczei(qq, y);
        ans = max(ans, pz + qz);
    }

    writeln(ans);
}

int calczei(int p, int x) {
    return p*(100+x)/100;
}

int calckmax(int p, int x) {
    int btm = 0, top = 2*p;

    while (top - btm > 1) {
        int mid = (btm + top) / 2;
        if (mid*(100+x)/100 <= p) {
            btm = mid;
        }
        else {
            top = mid;
        }
    }

    if (btm*(100+x)/100 == p) {
        return btm;
    }
    else {
        return 0;
    }
}

void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}