#CF1352B. 相同奇偶性的数之和(Same Parity Summands)
相同奇偶性的数之和(Same Parity Summands)
题目描述
You are given two positive integers ( ) and ( ). Represent the number as the sum of positive integers of the same parity (have the same remainder when divided by ).
In other words, find such that all , and either all are even or all are odd at the same time.
If such a representation does not exist, then report it.
输入格式
The first line contains an integer ( ) — the number of test cases in the input. Next, test cases are given, one per line.
Each test case is two positive integers ( ) and ( ).
输出格式
For each test case print:
- YES and the required values , 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