Online Programming Server

Bob is working at a cashier counter, he needs to make hundreds of changes everyday. But he is very laze and does not want to count how many and which types of banknotes he needs to change. So he asked you to write a program, which take in the amount of money customer paid, the price of goods bought, and then output numbers of each banknote to give back.

 

Available coins and banknotes are $1, $2, $5, $10, $20, $50, $100, $500, $1000. You have to always use the largest value you can. But since $1000 is the largest valued banknote, you will not need to consider $1000 (you will only receive but not give out $1000).

The first line is the number of customers, N, 1 ≤ N ≤ 100.

And then there will be N lines, each line has 2 integers. The first integer is the paid amount A, and the second integer is the total price P. Two integers are separated by a space. 1 ≤ A, P ≤ 30000.

Print N lines of 8 integers. Each line represents the changes to one customer.

From left to right, is the numbers of $500, $100, $50, $20, ......from larger value to smaller value.

Quotient and remainder.