Codeforces Round #457 (Div. 2) B. Jamie and Binary Sequence（思路+模拟）

B. Jamie and Binary Sequence (changed after round)

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Jamie is preparing a Codeforces round. He has got an idea for a problem, but does not know how to solve it. Help him write a solution to the following problem:

Find k integers such that the sum of two to the power of each number equals to the number n and the largest integer in the answer is as small as possible. As there may be multiple answers, you are asked to output the lexicographically largest one.

To be more clear, consider all integer sequence with length k (a1, a2, ..., ak) with . Give a value  to each sequence. Among all sequence(s) that have the minimum y value, output the one that is the lexicographically largest.

For definitions of powers and lexicographical order see notes.

Input

The first line consists of two integers n and k (1 ≤ n ≤ 1018, 1 ≤ k ≤ 105) — the required sum and the length of the sequence.

Output

Output "No" (without quotes) in a single line if there does not exist such sequence. Otherwise, output "Yes" (without quotes) in the first line, and k numbers separated by space in the second line — the required sequence.

It is guaranteed that the integers in the answer sequence fit the range [ - 1018, 1018].

Examples

input

23 5

output

Yes
3 3 2 1 0 

input

13 2

output

No

input

1 2

output

Yes
-1 -1 

Note

Sample 1:

23 + 23 + 22 + 21 + 20 = 8 + 8 + 4 + 2 + 1 = 23

Answers like (3, 3, 2, 0, 1) or (0, 1, 2, 3, 3) are not lexicographically largest.

Answers like (4, 1, 1, 1, 0) do not have the minimum y value.

Sample 2:

It can be shown there does not exist a sequence with length 2.

Sample 3:

Powers of 2:

If x > 0, then 2x = 2·2·2·...·2 (x times).

If x = 0, then 2x = 1.

If x < 0, then .

Lexicographical order:

Given two different sequences of the same length, (a1, a2, ... , ak) and (b1, b2, ... , bk), the first one is smaller than the second one for the lexicographical order, if and only if ai < bi, for the first i where ai and bi differ.

题意：给出一个数字n，求出用m个2^(x)的形式表示n，且要求max(x)最小，并要求字典序最大

max(x)最小这个条件很好满足，只需要每次把最大的二进数拆分成两个就行了

关键是求字典序最大，当把所有最大数的都拆成两个以后，数量大于m,此时就不能再拆最大的了，因为即使拆了最大的，也不能让max(x)再变小了，而且拆了以后前面的数变小会导致输出时字典序不是最大

这时候就应该从后往前找，不停地拆最小的来凑够m个

模拟这个过程就行了

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100000;
ll n,m,a[N*2+50];
int main()
{
    cin>>n>>m;
    string s="";
    while(n)
    {
        ll x=n%2;
        s+=x+'0';
        n/=2;
    }
    ll cnt=0;
    for(ll i=s.size()-1; i>=0; i--)
    {
        if(s[i]=='1')
        {
            a[i+N]++;
            m--;
        }
    }
    if(m<0)
        puts("No");
    else
    {
        ll head;
        puts("Yes");
        for(ll i=2*N; i>=0; i--)
        {
            if(m>=a[i])
            {
                m-=a[i];
                a[i-1]+=2*a[i];
                a[i]=0;
            }
            else
                break;
        }
        for(int i=1;i<=2*N;i++)
        {
            if(m&&a[i])
            {
                m--;
                a[i]--;
                a[i-1]+=2;
                i-=2;
            }
        }
        for(int i=N*2;i>=0;i--)
        {
            while(a[i])
            {
                a[i]--;
                printf("%d ",i-N);
            }
        }

    }
}