#include <bits/stdc++.h>
using namespace std;
bool can(int a, int b) {
  if (b >= 0 && b <= 9 * a) {
    return true;
  }
  return false;
}
int main() {
  int m, s;
  cin >> m >> s;
  int tmp = s;
  string max;
  string min;
  if (s == 0 && m == 1) {
    cout << "0 0" << endl;
    return 0;
  }
  if (s > 0 && (s <= m * 9)) {
    for (int i = 0; i < m; ++i) {
      if (9 < tmp) {
        max += char('0' + 9);
        tmp -= 9;
      } else {
        max += char('0' + tmp);
        tmp = 0;
      }
    }
    tmp = s;
    for (int i = 1; i <= m; ++i) {
      for (int j = 0; j < 10; ++j) {
        if (!(i == 1 && j == 0) && can(m - i, tmp - j)) {
          min += char('0' + j);
          tmp -= j;
          break;
        }
      }
    }
    cout << min << " " << max << endl;
  } else {
    cout << "-1 -1" << endl;
  }
  return 0;
}

### 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;
bool can(int a, int b) {
  if (b >= 0 && b <= 9 * a) {
    return true;
  }
  return false;
}
int main() {
  int m, s;
  cin >> m >> s;
  int tmp = s;
  string max;
  string min;
  if (s == 0 && m == 1) {
    cout << "0 0" << endl;
    return 0;
  }
  if (s > 0 && (s <= m * 9)) {
    for (int i = 0; i < m; ++i) {
      if (9 < tmp) {
        max += char('0' + 9);
        tmp -= 9;
      } else {
        max += char('0' + tmp);
        tmp = 0;
      }
    }
    tmp = s;
    for (int i = 1; i <= m; ++i) {
      for (int j = 0; j < 10; ++j) {
        if (!(i == 1 && j == 0) && can(m - i, tmp - j)) {
          min += char('0' + j);
          tmp -= j;
          break;
        }
      }
    }
    cout << min << " " << max << endl;
  } else {
    cout << "-1 -1" << endl;
  }
  return 0;
}

```