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:
from collections import Counter
from collections import defaultdict
import math
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
rls= lambda: list(map(str, input().split()))
from collections import deque



t=int(input())
for _ in range(0,t):
    a,k=rl()
    g=a
    f=1
    f1=0
    f2=0
    ans=[]
    if(a%2==0 and k%2==1):
        a=a-(k-1)*2
        if(a<=0):
            f=0
        else:
            ans.extend([2]*(k-1))
            ans.append(a)
    elif(a%2==1 and k%2==1):
        a=a-(k-1)*1
        if(a<=0):
            f=0
        else:
            ans.extend([1]*(k-1))
            ans.append(a)
    elif(a%2==0 and k%2==0):
        a = a - (k - 1) * 2
        if (a <= 0 or a%2==1):
            f = 0
        else:
            f2=1
            ans.extend([2] * (k - 1))
            ans.append(a)
        a=g
        a = a - (k - 1) * 1
        if (a <= 0 or a%2==0 ):
            f = 0
        elif(f2==0):
            f1=1
            ans.extend([1] * (k - 1))
            ans.append(a)
    elif (a % 2 == 1 and k % 2 == 0):
        a = a - (k - 1) * 1
        if (a <= 0 or a%2==0):
            f = 0
        else:
            ans.extend([1] * (k - 1))
            ans.append(a)
    if(f1 or f2 or f):
        print("YES")
        print(*ans)
    else:
        print("NO")