CodeForces The Child and Set

The Child and Set

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite set of Picks.

Fortunately, Picks remembers something about his set S:

• its elements were distinct integers from 1 to limit;
• the value of  was equal to sum; here lowbit(x) equals 2^k where k is the position of the first one in the binary representation of x. For example, lowbit(10010₂) = 10₂, lowbit(10001₂) = 1₂, lowbit(10000₂) = 10000₂ (binary representation).

Can you help Picks and find any set S, that satisfies all the above conditions?

Input

The first line contains two integers: sum, limit(1 ≤ sum, limit ≤ 10⁵).

Output

In the first line print an integer n(1 ≤ n ≤ 10⁵), denoting the size of S. Then print the elements of set S in any order. If there are multiple answers, print any of them.

If it's impossible to find a suitable set, print -1.

Sample Input

Input

5 5

Output

2
4 5

Input

4 3

Output

3
2 3 1

Input

5 1

Output

-1

Hint

In sample test 1: lowbit(4) = 4, lowbit(5) = 1, 4 + 1 = 5.

In sample test 2: lowbit(1) = 1, lowbit(2) = 2, lowbit(3) = 1, 1 + 2 + 1 = 4.

给你一个sum和一个limit，现在要你在1~limit中找到一些数来使得这些数的和等于sum，如果能找到的话就输出找到的数的个数和这些数，未找到输出"-1"。

求出二进制的低位（从最先出现1的位置截断），其实就是位运算x^(-x)

#include <iostream>
#include <algorithm>
using namespace std;
int lowbit(int x)
{
    return x&(-x);
}
int main()
{
    int a[100001],ans,b[100001];
    a[0]=0;
    for (int i=1; i<100001; i++)
    {
        a[i]=lowbit(i);
    }
    int sum,L;
    while (cin>>sum>>L)
    {
        ans=0;
        for (int i=L; i&& sum; i--)
        {
            if(sum>=a[i])
            {
                b[ans++]=i;
                sum-=a[i];
            }
        }
        if(sum==0)
        {
            cout<<ans<<endl;
            for (int i=0; i<ans; i++)
            {
                if(i==ans-1)
                {
                    cout<<b[i]<<endl;
                }
                else
                {
                    cout<<b[i]<<" ";
                }
            }
        }
        else
        {
            cout<<"-1"<<endl;
        }
        
    }
    return 0;
}