跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1839. Given Length and Sum of Digits

    ID: 1845 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 3 上传者: 标签>动态规划贪心模拟算法思想编程与模拟基础难度共享题库Codeforces英文题面题目来源题面语言

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

题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 1408 题。保留原作者与原赛事署名。