Problem: You are given two positive integers n (1 ≤ n ≤ 10^9) and k (1 ≤ k ≤ 100). Represent the number n as the sum of k positive integers of the same parity (have the same remainder when divided by 2).

In other words, find a_1, a_2, …, a_k such that all a_i>0, n = a_1 + a_2 + … + a_k and either all a_i are even or all a_i are odd at the same time.

If such a representation does not exist, then report it.

Input

The first line contains an integer t (1 ≤ t ≤ 1000) — the number of test cases in the input. Next, t test cases are given, one per line.

Each test case is two positive integers n (1 ≤ n ≤ 10^9) and k (1 ≤ k ≤ 100).

Output

For each test case print:

  * YES and the required values a_i, if the answer exists (if there are several answers, print any of them); 
  * NO if the answer does not exist. 



The letters in the words YES and NO can be printed in any case.

Example

Input


8
10 3
100 4
8 7
97 2
8 8
3 10
5 3
1000000000 9


Output


YES
4 2 4
YES
55 5 5 35
NO
NO
YES
1 1 1 1 1 1 1 1
NO
YES
3 1 1
YES
111111110 111111110 111111110 111111110 111111110 111111110 111111110 111111110 111111120

Solution (in PYTHON3):

Solution:
# Question 2
t = int(input())

def oddcheck(num: int, k: int) -> bool:
    lo = num - (k-1) * 1
    if lo <= 0:
        return False
    else:
        if lo % 2 == 1 and lo > 0:
            return True
        else:
            return False

def evencheck(num: int, k: int) -> bool:
    lo = num - (k-1) * 2
    if lo <= 0:
        return False
    else:
        if lo % 2 == 1:
            return False
        else:
            return True

for q in range(t):
    n, k = tuple(map(int, input().split()))
    cond1 = oddcheck(n, k)
    cond2 = evencheck(n, k)
    if cond1:
        print('YES')
        tgt = [1] * (k - 1)
        tgt.append(n - (k - 1))
        res = ''
        for i in tgt:
            res = res + str(i) + ' '
        print(res)

    elif cond2:
        print('YES')
        tgt = [2] * (k - 1)
        tgt.append(n - (k - 1) * 2)
        res = ''
        for i in tgt:
            res = res + str(i) + ' '
        print(res)

    elif cond1 and cond2:
        print('YES')
        tgt = [1] * (k - 1)
        tgt.append(n - (k - 1))
        res = ''
        for i in tgt:
            res = res + str(i) + ' '
        print(res)

    else:
        print('NO')