1957B - A BIT of a Construction - CodeForces Solution

t = int(input())

for _ in range(t):

    n, k = map(int, input().split())
    ans = []
    current_pow = 0
    summ = 0
    while True:
        if (summ + 2**current_pow) < k:
            summ += 2**current_pow
            ans.append(2**current_pow)
            current_pow += 1
        else:
            break
    if (k-summ) > 0:
        ans.append(k-summ)
    if len(ans) > n:
                while len(ans) > n:
            a = ans.pop(0)
            b = ans.pop(0)
            ans = [a+b] + ans
    if len(ans) < n:
                while len(ans) < n:
            ans.append(0)
    print(' '.join(map(str, ans)))