{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"给你两个正整数n(1≤n≤1e9)和k(1≤k≤100)。将数字n表示为k个奇偶性相同的正整数之和(除以2时有相同的余数)。\n\n换句话说,找到a1,a2,...,ak,使所有ai\u003e0,n\u003da1+a2+...+ak,并且所有ai都是偶数或所有ai同时是奇数。\n\n如果不存在这样的表示方法,那么就报告。"}},{"title":"Input","value":{"format":"HTML","content":"第一行包含一个整数t(1≤t≤1000)--输入的测试用例数。接下来,给出t个测试用例,每行一个。\n\n每个测试用例是两个正整数n(1≤n≤1e9)和k(1≤k≤100)。"}},{"title":"Output","value":{"format":"HTML","content":"对于每个测试用例打印。\n\n如果答案存在,则打印YES和所需值ai(如果有几个答案,则打印其中任何一个)。\n如果答案不存在,则打印NO。\nYES和NO这两个词中的字母在任何情况下都可以打印。"}},{"title":"Example","value":{"format":"HTML","content":"\u003cdiv class\u003d\"sample-test\"\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e8\n10 3\n100 4\n8 7\n97 2\n8 8\n3 10\n5 3\n1000000000 9\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003eYES\n4 2 4\nYES\n55 5 5 35\nNO\nNO\nYES\n1 1 1 1 1 1 1 1\nNO\nYES\n3 1 1\nYES\n111111110 111111110 111111110 111111110 111111110 111111110 111111110 111111110 111111120\n\u003c/pre\u003e\n \u003c/div\u003e\n\u003c/div\u003e"}}]}