write a go solution for Description:
A positive integer x is called a power of two if it can be represented as x=2^y, where y is a non-negative integer. So, the powers of two are 1,2,4,8,16,....

You are given two positive integers n and k. Your task is to represent n as the sum of exactly k powers of two.

Input Format:
The only line of the input contains two integers n and k (1<=n<=10^9, 1<=k<=2*10^5).

Output Format:
If it is impossible to represent n as the sum of k powers of two, print NO.

Otherwise, print YES, and then print k positive integers b_1,b_2,...,b_k such that each of b_i is a power of two, and sumlimits_i=1^kb_i=n. If there are multiple answers, you may print any of them.

Note:
None. Output only the code with no comments, explanation, or additional text.