import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.format;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;

alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", long, "x");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void minAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) min(dst, src);
}

void maxAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) max(dst, src);
}

enum MOD = (10 ^^ 9) + 7;

void main()
{
    long N, Y;
    scan(N, Y);

    auto ans = solve(N, Y / 1000);
    writefln("%d %d %d", ans[0], ans[1], ans[2]);
}

long[3] solve(long N, long Y)
{
    if (Y == 0 && N == 0)
        return [0, 0, 0];
    if (0 == N)
        return [-1, -1, -1];
    if (Y < N)
        return [-1, -1, -1];

    auto a = memoize!solve(N - 1, Y - 10);
    if (a[0] != -1)
    {
        a[0]++;
        return a;
    }
    auto b = memoize!solve(N - 1, Y - 5);
    if (b[0] != -1)
    {
        b[1]++;
        return b;
    }
    auto c = memoize!solve(N - 1, Y - 1);
    if (c[0] != -1)
    {
        c[2]++;
        return c;
    }
    return [-1, -1, -1];
}
