Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Wizards and Demonstration

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

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

There are *n* people living in the city, *x* of them are the wizards who will surely go to the demonstration. Other city people (*n* - *x* people) 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 least *y* percent 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 only *n* people and not containing any clone puppets.

Help the wizards and find the minimum number of clones to create to that the demonstration had no less than *y* percent of the city people.

Input

The first line contains three space-separated integers, *n*, *x*, *y* (1 ≤ *n*, *x*, *y* ≤ 10^{4}, *x* ≤ *n*) — the number of citizens in the city, the number of wizards and the percentage the administration needs, correspondingly.

Please note that *y* can exceed 100 percent, that is, the administration wants to see on a demonstration more people that actually live in the city ( > *n*).

Output

Print a single integer — the answer to the problem, the minimum number of clones to create, so that the demonstration involved no less than *y* percent of *n* (the real total city population).

Examples

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 should be integer, then at least two people should 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 should come to the demonstration. The city has 10 wizards. They will all come to the demonstration, so nobody has to create any clones.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/19/2020 12:04:38 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|