Problem: 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

The only line of the input contains two integers n and k (1 ≤ n ≤ 10^9, 1 ≤ k ≤ 2 ⋅ 10^5).

Output

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 ∑ _{i = 1}^{k} b_i = n. If there are multiple answers, you may print any of them.

Examples

Input


9 4


Output


YES
1 2 2 4 


Input


8 1


Output


YES
8 


Input


5 1


Output


NO


Input


3 7


Output


NO

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int good(int n, int k) { return k <= n && k >= __builtin_popcount(n); }
void make(int n, int k) {
  if (k == 0) return;
  int x = 1;
  while (1) {
    if (good(n - x, k - 1)) {
      printf("%d ", x);
      make(n - x, k - 1);
      return;
    }
    x <<= 1;
  }
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  if (!good(n, k)) {
    puts("NO");
    return 0;
  }
  puts("YES");
  make(n, k);
  puts("");
}