A. wizards and demonstration

Time limit per test

2 seconds

Memory limit per test

256 megabytes

Input

Standard Input

Output

Standard output

Some country is populated by wizards. They want to organize a demonstration.

There areNPeople living in the city,XOf
Them are the wizards who will surely go to the demonstration. Other city people (NAccept-Encoding-XPeople) do not support the wizards and aren't
Going to go to the demonstration. We know that the city administration will react only to the demonstration involving at leastYPercent
Of the city people. Having considered the matter, the Wizards decided to create clone puppets which can substitute the city people on the demonstration.

So all in all, the demonstration will involve only the wizards and their puppets. the city administration cannot tell the difference between a puppet and a person, so, as they calculate the percentage, the Administration will consider the city to be consisting
Of onlyNPeople and not containing any clone puppets.

Help the wizards and find the minimum number of clones to create to that the demonstration had no lessYPercent of the city people.

Input

The first line contains three space-separated integers,N,X,Y(1 digit ≤ DigitN, Bytes,X, Bytes,YLimit ≤ limit 10^{4, middle,XLimit ≤ limitN)
-The number of citizens in the city, the number of wizards and the percentage the administration needs, correspondingly.}

Please note thatYCan exceed 100 percent, that is, the Administration wants to see on a demonstration more people that actually live in
City (Hangzhou> HangzhouN).

Output

Print a single integer-the answer to the problem, the minimum number of clones to create, so that the demonstration involved no lessYPercent
OfN(The real total city population ).

Sample test (s) Input

10 1 14

Output

1

Input

20 10 50

Output

0

Input

1000 352 146

Output

1108

Note

In the first sample it is necessary that at least 14% of 10 people came to the demonstration. as the number of people shocould be integer, then at least two people shocould come. there is only one wizard living in the city and he is going to come. that isn' t enough,
So he needs to create one clone.

In the second sample 10 people shoshould come to the demonstration. The city has 10 wizards. They will all come to the demonstration, so nobody has to create any clones.

Explanation: this is a simple mathematical operation. Pay attention to the remainder.

#include <iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int main(){int n,x,y;int temp;scanf("%d %d %d",&n,&x,&y);temp=n*y;if(temp%100!=0){temp=n*y/100+1;}else{temp=n*y/100;}if(temp-x>=0){printf("%d\n",temp-x);}else{printf("0\n");}return 0;}