Vasya and Digital Root

Vasya has recently found out what a digital root of a number is and he decided to share his knowledge with you.
Let’s assume that S(n) is the sum of digits of number n, for example, S(4098) = 4 + 0 + 9 + 8 = 21. Then the digital root of number n equals to:
dr(n) = S(n), if S(n) < 10;
dr(n) = dr( S(n) ), if S(n) ≥ 10.
For example, dr(4098)  =  dr(21)  =  3.
Vasya is afraid of large numbers, so the numbers he works with are at most 101000. For all such numbers, he has proved that dr(n)  =  S( S( S( S(n) ) ) ) (n ≤ 101000).
Now Vasya wants to quickly find numbers with the given digital root. The problem is, he hasn’t learned how to do that and he asked you to help him. You task is, given numbers k and d, find the number consisting of exactly k digits (the leading zeroes are not allowed), with digital root equal to d, or else state that such number does not exist.

Input
The first line contains two integers k and d (1 ≤ k ≤ 1000; 0 ≤ d ≤ 9).

Output
In a single line print either any number that meets the requirements (without the leading zeroes) or “No solution” (without the quotes), if the corresponding number does not exist.
The chosen number must consist of exactly k digits. We assume that number 0 doesn’t contain any leading zeroes.

Examples
Input
4 4

Output
5881

Input
5 1

Output
36172

Input
1 0

Output
0

Note
For the first test sample dr(5881)  =  dr(22)  =  4.
For the second test sample dr(36172)  =  dr(19)  =  dr(10)  =  1.

分析：只需要输出d和后面的一些‘0’就OK了。

代码如下：

#include"stdio.h"
#include"iostream"
int main()
{
	int k,d;
	while(~scanf("%d %d",&k,&d))
	{
		if(d==0&&k==1)
		{
			printf("0\n");
		}
		else if(d==0&&k>1)
		{
			printf("No solution\n");
		}
		else
		{
			printf("%d",d);
			for(int i=0;i<k-1;i++)
			{
				printf("0");
			}
		}
		printf("\n");
	}
	return 0;
}