Codeforces Round #277.5 (Div. 2)：C. Given Length and Sum of Digits...

C. Given Length and Sum of Digits...

time limit per test  1 second

memory limit per test  256 megabytes

input  standard input

output  standard output

You have a positive integer m and a non-negative integer s. Your task is to find the smallest and the largest of the numbers that have length m and sum of digits s. The required numbers should be non-negative integers written in the decimal base without leading zeroes.

Input

The single line of the input contains a pair of integers m, s (1 ≤ m ≤ 100, 0 ≤ s ≤ 900) — the length and the sum of the digits of the required numbers.

Output

In the output print the pair of the required non-negative integer numbers — first the minimum possible number, then — the maximum possible number. If no numbers satisfying conditions required exist, print the pair of numbers "-1 -1" (without the quotes).

Examples

input

2 15

output

69 96

input

3 0

output

-1 -1

题意：输入两个数n，m表示要你构造一个长度为n位，每位数字和为m的数，输出最小可能和最大可能

①特判为-1的情况，注意n=1，m=0的特例

②先求出最大可能，很显然从高位到低位贪心就好了，每次都是能填多大的数填多大的数（从9到0）

③可以想到把最大的数反过来就是最小的数，不过这样可能出现前导0，从后面借一个数就ok

#include<stdio.h>
#include<string.h>
int p[105], q[105];
int main(void)
{
	int n, m, i, j;
	scanf("%d%d", &n, &m);
	if(m<1 && n>=2 || m>9*n)
		printf("-1 -1\n");
	else
	{
		for(i=n;i>=1;i--)
		{
			for(j=9;j>=0;j--)
			{
				if(m>=j)
				{
					q[i] = p[i] = j;
					m -= j;
					break;
				}
			}
		}
		memcpy(q, p, sizeof(p));
		if(p[1]==0)
		{
			for(j=2;j<=n;j++)
			{
				if(p[j]!=0)
				{
					p[1]++, p[j]--;
					break;
				}
			}
		}
		for(i=1;i<=n;i++)
			printf("%d", p[i]);
		printf(" ");
		for(i=n;i>=1;i--)
			printf("%d", q[i]);
		puts("");
	}
	return 0;
}