codeforces-727A

Vasily has a number a, which he wants to turn into a number b. For this purpose, he can do two types of operations:

• multiply the current number by 2 (that is, replace the number x by 2·x);
• append the digit 1 to the right of current number (that is, replace the numberx by 10·x + 1).

You need to help Vasily to transform the number a into the number b using only the operations described above, or find that it is impossible.

Note that in this task you are not required to minimize the number of operations. It suffices to find any way to transform a into b.

Input

The first line contains two positive integers a and b (1 ≤ a < b ≤ 10⁹) — the number which Vasily has and the number he wants to have.

Output

If there is no way to get b from a, print "NO" (without quotes).

Otherwise print three lines. On the first line print "YES" (without quotes). The second line should contain single integer k — the length of the transformation sequence. On the third line print the sequence of transformations x₁, x₂, ..., x_k, where:

• x₁ should be equal to a,
• x_k should be equal to b,
• x_i should be obtained from x_i - 1 using any of two described operations (1 < i ≤ k).

If there are multiple answers, print any of them.

Example

Input

2 162

Output

YES
5
2 4 8 81 162 

Input

4 42

Output

NO

Input

100 40021

Output

YES
5
100 200 2001 4002 40021 

这道题其实有好多种办法的，大神用队列过的，我是从最后一个数字往前推，得到第一个数字，大神说我这个A题思路是对的，但是我却写出了C题的感觉，哈哈哈哈哈哈哈哈，挺尴尬的，，，，下面附上我AC的代码，虽然和那些大神们AC 的代码没法比，但是这是我费劲九牛二虎之力一点点改过来的，真是不忍心删掉啊，哈哈，希望以后我的代码水平会有所改进吧……

#include <stdio.h>
int c[100005];
int main()
{
	int a,b;
	int sum=0;
	int ok=0,m=0;	
	scanf("%d %d",&a,&b);
//	c[m++]=b;
	int k=a;
	int y=b;	
		if(a>b)
		{
			printf("NO\n");
			return 0;
		}
		else
		{
			while(a<b)
			{
				if(b%2==0)
				{
					b/=2;
					c[m++]=b;
					sum++;
				}
				else if((b%2!=0)&&(b-1)%10==0)
				{
					b=(b-1)/10;
					c[m++]=b;
					sum++;
				}
				//printf("%d ",b);
				if(b==k)
				{
					ok=1;
					break;
				}
				if((b%2!=0)&&((b-1)%10!=0))
				{
					ok=0;break;
				}
				
			}
			if(ok==1)
			{
				printf("YES\n");
			}
			else
			{
				printf("NO\n");
				return 0;
			}	
			printf("%d\n",sum+1);
			for(int m=sum-1;m>=0;m--)
			{
				printf("%d ",c[m]);
			}
			printf("%d\n",y);
		}
	return 0;
}