output_description: If the total value of N bills cannot be Y yen, print `-1 -1 -1`.
  
  If the total value of N bills can be Y yen, let one such set of bills be "x
  10000-yen bills, y 5000-yen bills and z 1000-yen bills", and print x, y, z
  with spaces in between. If there are multiple possibilities, any of them may
  be printed.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N Y
attempt: mycode = r"""
  # distutils: language=c++
  # cython: language_level=3
  # cython: boundscheck=False
  # cython: wraparound=False
  # cython: infer_types=True
  # cython: cdivision=True
  # False:Cython はCの型に対する除算・剰余演算子に関する仕様を、(被演算子間の符号が異なる場合の振る舞いが異なる)Pythonのintの仕様に合わせ、除算する数が0の場合にZeroDivisionErrorを送出します。この処理を行わせると、速度に 35% ぐらいのペナルティが生じます。 True:チェックを行いません。
  
  ctypedef long long LL
  
  import numpy as np
  
  # 読み込みはpython側で行う
  import sys
  readline = sys.stdin.buffer.readline
  read = sys.stdin.readline #文字列読み込む時はこっち
  
  def exit(*argv,**kwarg):
      print(*argv,**kwarg)
      sys.exit()
  
  
  def ints(): return np.fromstring(readline(), sep=' ', dtype=np.int64)
  
  cdef LL i,j,k,_
  
  cdef LL N,Y
  N,Y=ints()
  Y//=1000
  
  cdef LL a,b,c #a+b+c=Nかつ10a+5b+c=Yを満たすa,b,cを見つけたい
  for a in range(N+1):
      for b in range(N+1):
          c = N-a-b
          if c<0 : break
          if 10*a+5*b+c==Y:
              exit(a,b,c)
  print(-1,-1,-1)
          
  
  
  """
  
  import sys
  
  if sys.argv[-1] == "ONLINE_JUDGE":  # コンパイル時
      import os
  
      with open("mycode.pyx", "w") as f:
          f.write(mycode)
      os.system("cythonize -i -3 -b mycode.pyx")
  
  import mycode
  
problem_description: Statement
  
  The commonly used bills in Japan are 10000-yen, 5000-yen and 1000-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 N bills for a total of Y 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.
samples: [{"input": "9 45000", "output": "4 0 5\n    \n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9\nbills and 45000 yen in total. It is also possible that the envelope contained\n9 5000-yen bills, so the output `0 9 0` is also correct.\n\n* * *"}, {"input": "20 196000", "output": "-1 -1 -1\n    \n\nWhen the envelope contained 20 bills in total, the total value would be 200000\nyen if all the bills were 10000-yen bills, and would be at most 195000 yen\notherwise, so it would never be 196000 yen.\n\n* * *"}, {"input": "1000 1234000", "output": "14 27 959\n    \n\nThere are also many other possibilities.\n\n* * *"}, {"input": "2000 20000000", "output": "2000 0 0"}]