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 main() {
  int n, k;
  cin >> n >> k;
  queue<int> q;
  map<int, int> m;
  for (int i = 0; i <= 29; i++) {
    if (n & (1 << i)) {
      m[1 << i]++;
      if (i > 0) {
        q.push(1 << i);
      }
    }
  }
  if (m.size() > k) {
    cout << "NO";
    return 0;
  }
  int count1 = m.size();
  while (count1 < k && !q.empty()) {
    int p = q.front();
    q.pop();
    m[p]--;
    m[p / 2]++;
    m[p / 2]++;
    if (p / 2 > 1) {
      q.push(p / 2);
      q.push(p / 2);
    }
    count1++;
  }
  if (count1 < k) {
    cout << "NO";
    return 0;
  }
  cout << "YES" << endl;
  for (auto it = m.begin(); it != m.end(); it++) {
    for (int i = 0; i < it->second; i++) {
      cout << it->first << " ";
    }
  }
  return 0;
}