Jabba: Han, my boy, you disappoint me. Why haven’t you paid me? And why did you fry poor Greedo?
Han: Look, Jabba, next time you wanna talk to me, come see me yourself. Don’t send one of these twerps.
Jabba: Han, I can’t make exceptions. What if everyone who smuggled for me dropped their cargo at the first sign of an imperial starship?
Han Solo and his flight mechanic Chewbacca are experienced smugglers.
They have spent several years working for a crime boss of the Tatooine planet Jabba the Hutt.
But even the best of the best blow it sometimes.
During a flight, captain Solo’s ship called «Millennium Falcon» met imperial customs officers.
Han was transporting cargo consisting of n bags with spices.
Each bag weighs an integer number of kilograms.
Han noticed the customs officers from above and decided to dump the cargo into space.
Captain Solo dumped the first bag. Then he decided to take a risk and leave part of the cargo in the secret section.
Han was checking each bag, and during that he was counting how many bags he has already checked (including the first one) that were lighter than the current one.
He left a bag on the ship only if that number was at least p percent from the total number of the bags that have already been checked.
Using this strategy Solo hoped to leave the most important part of the cargo on the ship.
As a result, he was left with only k bags that fit in the secret section easily.
The customs officers couldn’t find anything and they left the «Millennium Falcon».
Now Han understands that he has lost quite a large part of the cargo and that Jabba is going to be quite displeased.
Unfortunately, he doesn’t remember the total weight of the transported goods.
Help Han find the minimum possible total weight just to show him how big a loser he is.
The first line contains integers n and k (1 ≤ k < n ≤ 105).
The second line contains integer p (1 ≤ p ≤ 100).
In the first line, print the answer to the problem.
In the second line print n space-separated integers — the bags’ weights in kilograms in the order Captain Solo checked them, including the first bag.
If there are multiple sequences that meet the problem statement, you can print any of them.
It is guaranteed that at least one such sequence exists.
1 2 1
Problem Author: Denis Dublennykh (prepared by Oleg Dolgorukov)