A customer makes a purchase in a store, but can not pay the exact money. The shopkeeper must give change, and wants to use as less notes and coins as possible. He has notes of 500, 200, 100, 50, 20, 10, 5 euro and coins of 2 euro, 1 euro and 50, 20, 10, 5, 2 and 1 cent. Write a program that helps the retailer to determine how many notes and coins of every kind he has to return.

Input

Two lines. The first line is the total amount $$t$$ that the customer has to pay. The second line shows the amount $$b$$ that the customer pays to the retailer. Both amounts are expressed in euros and are displayed as decimal numbers. You may assume that $$t \leq b$$.

Output

Fifteen lines, each containing a single integer that indicates the number of notes or coins of each kind that should be returned. The number of notes or coins by type must be written in descending order of value: so the first number indicates how many notes of 500 euros the retailer must return and the last number is how many coins of 1 cent he must return.

Example

Input:

379.93
1000.00

Output:

1
0
1
0
1
0
0
0
0
0
0
0
1
1
0