CF 489 C Given Length and Sum of Digits... 贪心

题目链接：http://codeforces.com/problemset/problem/489/C

题目大意：给定位数和各个位的和，问满足条件数字的最大值，最小值。

解题思路：模拟即可。主要是细节判断。

代码：

const int inf = 0x3f3f3f3f;
const int maxn = 1e2 + 5;
int m, s;
char ans1[maxn], ans2[maxn];

void solve(){
    memset(ans1, 0, sizeof(ans1));
    memset(ans2, 0, sizeof(ans1));
    
    if((s == 0 && m > 1) || s > m * 9) {
        printf("-1 -1
");
        return;
    }
    int x = s;
    for(int i = 1; i <= m; i++){
        int u = (m - i) * 9;
        if(u < x) {
            ans1[i] = (x - u + '0');
            x = u;
        }
        else if(u == x){
            if(i == 1) {
                if(x > 0) {
                    ans1[i] = '1';
                    x -= 1;
                }
                else ans1[i] = '0';
            }
            else {
                ans1[i] = '0';
            }
        }
        else if(u > x) {
            if(i == 1) {
                ans1[i] = '1';
                x -= 1;
            }
            else ans1[i] = '0';
        }
    }
    x = s;
    for(int i = 1; i <= m; i++){
        if(x >= 9) {
            ans2[i] = '9';
            x -= 9;
        }
        else{
            ans2[i] = (x + '0');
            x = 0;
        }
    }
    
    printf("%s %s
", ans1 + 1, ans2 + 1);
}
int main(){
    scanf("%d %d", &m, &s);
    solve();
}

题目：

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