Same Parity Summands

You are given two positive integers n (1≤n≤10⁹) 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 a1,a2,…,ak such that all ai>0, n=a1+a2+…+ak and either all ai are even or all ai 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⁹) and k (1≤k≤100).

Output

For each test case print:

YES and the required values ai, 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.

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

Notes

题意是把n分解成k个数，但是要求这k个数要么同时是奇数、要么同时是偶数。自然的我们分两种情况讨论。

1. k个数全是奇数，那必须满足n-k>=0 && (n-k)%2==0。就是先给这k个数各自分配一个1，剩下的数必须是偶数，然后这个数任意分配就行了。
2. k个数全是偶数，那么必须满足(n-2k)>=0 && (n-2k)%2==0。就是先给k个数各自分配一个2，剩下的数必须是偶数，然后这个数任意分配。

AC Code

#include<iostream>
using namespace std;
void SPS(int n, int k){
	if((n-k)>=0 && (n-k)%2==0 || (n-2*k)>=0 && (n-2*k)%2==0){
		printf("YES\n");
		if((n-k)%2==0){
			for(int i=0; i<k-1; ++i){
				printf("1 ");
			}
			printf("%d\n", 1+n-k);
		} else {
			for(int i=0; i<k-1; ++i){
				printf("2 ");
			}
			printf("%d\n", 2+n-2*k);
		}
	} else {
		printf("NO\n");
	}
}
int main(){
	//freopen("C:\\Users\\Ambition\\Desktop\\in.txt","r",stdin);
	int t, n, k;
	scanf("%d", &t);
	while(t--){
		scanf("%d %d", &n, &k);
		SPS(n, k);
	}
	return 0;
}