#include <bits/stdc++.h>
using namespace std;
int a[107], b[107];
int ans = 0;
int main() {
  int m, s;
  while (~scanf("%d %d", &m, &s)) {
    if (m * 9 < s || (s == 0 && m != 1))
      cout << "-1 -1" << endl;
    else {
      memset(a, 0, sizeof(a));
      memset(b, 0, sizeof(b));
      int m1 = m, s1 = s;
      for (int i = m - 1; i >= 0; --i) {
        if (s > 9) {
          a[i] = 9;
          s -= 9;
        } else if (i != 0) {
          a[i] = s - 1;
          s = 1;
        } else {
          a[i] = s;
        }
      }
      for (int i = 0; i < m; ++i) {
        if (s1 > 9) {
          b[i] = 9;
          s1 -= 9;
        } else {
          b[i] = s1;
          s1 = 0;
        }
      }
      for (int i = 0; i < m; ++i) {
        printf("%d", a[i]);
      }
      printf(" ");
      for (int i = 0; i < m; ++i) {
        printf("%d", b[i]);
      }
      printf("\n");
    }
  }
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

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 a[107], b[107];
int ans = 0;
int main() {
  int m, s;
  while (~scanf("%d %d", &m, &s)) {
    if (m * 9 < s || (s == 0 && m != 1))
      cout << "-1 -1" << endl;
    else {
      memset(a, 0, sizeof(a));
      memset(b, 0, sizeof(b));
      int m1 = m, s1 = s;
      for (int i = m - 1; i >= 0; --i) {
        if (s > 9) {
          a[i] = 9;
          s -= 9;
        } else if (i != 0) {
          a[i] = s - 1;
          s = 1;
        } else {
          a[i] = s;
        }
      }
      for (int i = 0; i < m; ++i) {
        if (s1 > 9) {
          b[i] = 9;
          s1 -= 9;
        } else {
          b[i] = s1;
          s1 = 0;
        }
      }
      for (int i = 0; i < m; ++i) {
        printf("%d", a[i]);
      }
      printf(" ");
      for (int i = 0; i < m; ++i) {
        printf("%d", b[i]);
      }
      printf("\n");
    }
  }
  return 0;
}

```