#CF1352B. 相同奇偶性的数之和(Same Parity Summands)

相同奇偶性的数之和(Same Parity Summands)

题目描述

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

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

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

输入格式

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

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

输出格式

For each test case print:

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

输入输出样例 #1

输入 #1

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

输出 #1

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