#include <bits/stdc++.h>
using namespace std;
int n, m, k;
string x, y;
int main() {
  cin >> m >> n;
  k = n;
  if ((n == 0 && m > 1) || (9 * m < n)) {
    cout << "-1 -1\n";
    return 0;
  }
  if (n == 0 && m == 1) {
    cout << "0 0\n";
    return 0;
  }
  y = "";
  for (int i = 0; i < m; i++) {
    if (n >= 9) {
      y += '9';
      n -= 9;
    } else {
      y += (n + '0');
      n = 0;
    }
  }
  x = "";
  n = k;
  for (int i = 0; i < m; i++) {
    if (n > 9) {
      x += '9';
      n -= 9;
    } else {
      if (i == (m - 1)) {
        if (n > 0) {
          x += (n + '0');
        } else {
          x += '1';
        }
      } else {
        if (n) n--;
        x += (n + '0');
        n = 0;
      }
    }
  }
  reverse(x.begin(), x.end());
  cout << x << " " << y << "\n";
}

### Prompt

Please formulate a CPP solution to 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 n, m, k;
string x, y;
int main() {
  cin >> m >> n;
  k = n;
  if ((n == 0 && m > 1) || (9 * m < n)) {
    cout << "-1 -1\n";
    return 0;
  }
  if (n == 0 && m == 1) {
    cout << "0 0\n";
    return 0;
  }
  y = "";
  for (int i = 0; i < m; i++) {
    if (n >= 9) {
      y += '9';
      n -= 9;
    } else {
      y += (n + '0');
      n = 0;
    }
  }
  x = "";
  n = k;
  for (int i = 0; i < m; i++) {
    if (n > 9) {
      x += '9';
      n -= 9;
    } else {
      if (i == (m - 1)) {
        if (n > 0) {
          x += (n + '0');
        } else {
          x += '1';
        }
      } else {
        if (n) n--;
        x += (n + '0');
        n = 0;
      }
    }
  }
  reverse(x.begin(), x.end());
  cout << x << " " << y << "\n";
}

```