#include <bits/stdc++.h>
using namespace std;
int M, S;
int main() {
  scanf("%d %d", &M, &S);
  if (S == 0 && M == 1)
    puts("0 0");
  else if (S > M * 9 || S < 1)
    puts("-1 -1");
  else {
    int p;
    p = S;
    for (int Mi = M; Mi >= 1; Mi--) {
      int x;
      if (Mi == M)
        x = max(1, p - (Mi - 1) * 9);
      else
        x = max(0, p - (Mi - 1) * 9);
      printf("%d", x);
      p -= x;
    }
    printf(" ");
    p = S;
    for (int Mi = M; Mi >= 1; Mi--) {
      int x;
      x = min(9, p);
      printf("%d", x);
      p -= x;
    }
    puts("");
  }
}

### Prompt

In CPP, your task is to solve the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int M, S;
int main() {
  scanf("%d %d", &M, &S);
  if (S == 0 && M == 1)
    puts("0 0");
  else if (S > M * 9 || S < 1)
    puts("-1 -1");
  else {
    int p;
    p = S;
    for (int Mi = M; Mi >= 1; Mi--) {
      int x;
      if (Mi == M)
        x = max(1, p - (Mi - 1) * 9);
      else
        x = max(0, p - (Mi - 1) * 9);
      printf("%d", x);
      p -= x;
    }
    printf(" ");
    p = S;
    for (int Mi = M; Mi >= 1; Mi--) {
      int x;
      x = min(9, p);
      printf("%d", x);
      p -= x;
    }
    puts("");
  }
}

```