#abc085c. [abc085_c]Otoshidama

[abc085_c]Otoshidama

Problem Statement

The commonly used bills in Japan are 1000010000-yen, 50005000-yen and 10001000-yen bills. Below, the word "bill" refers to only these.

According to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained NN bills for a total of YY yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.

Constraints

  • 1N20001 ≤ N ≤ 2000
  • 1000Y2×1071000 ≤ Y ≤ 2 × 10^7
  • NN is an integer.
  • YY is a multiple of 10001000.

Input

Input is given from Standard Input in the following format:

NN YY

Output

If the total value of NN bills cannot be YY yen, print -1 -1 -1.

If the total value of NN bills can be YY yen, let one such set of bills be "xx 1000010000-yen bills, yy 50005000-yen bills and zz 10001000-yen bills", and print xx, yy, zz with spaces in between. If there are multiple possibilities, any of them may be printed.


Sample Input 1

9 45000

Sample Output 1

4 0 5

If the envelope contained 44 1000010000-yen bills and 55 10001000-yen bills, he had 99 bills and 4500045000 yen in total. It is also possible that the envelope contained 99 50005000-yen bills, so the output 0 9 0 is also correct.


Sample Input 2

20 196000

Sample Output 2

-1 -1 -1

When the envelope contained 2020 bills in total, the total value would be 200000200000 yen if all the bills were 1000010000-yen bills, and would be at most 195000195000 yen otherwise, so it would never be 196000196000 yen.


Sample Input 3

1000 1234000

Sample Output 3

14 27 959

There are also many other possibilities.


Sample Input 4

2000 20000000

Sample Output 4

2000 0 0