#include <bits/stdc++.h>
using namespace std;
bool can(int m, int s) { return s >= 0 && s <= 9 * m; }
int main() {
  int m, s;
  cin >> m >> s;
  if (m == 1 && s == 0) {
    cout << "0 0\n";
    return 0;
  } else if (m > 1 && s == 0) {
    cout << "-1 -1\n";
    return 0;
  }
  string minn, maxx;
  int sum = s;
  for (int i = 0; i < m; ++i) {
    for (int d = 0; d < 10; ++d) {
      if (i == 0 && d == 0) continue;
      if (can(m - i - 1, sum - d)) {
        minn += (char)('0' + d);
        sum -= d;
        break;
      }
    }
  }
  sum = s;
  for (int i = 0; i < m; ++i) {
    for (int d = 9; d >= 0; --d) {
      if (i == 0 && d == 0) continue;
      if (can(m - i - 1, sum - d)) {
        maxx += (char)('0' + d);
        sum -= d;
        break;
      }
    }
  }
  if (minn == "" || maxx == "")
    cout << "-1 -1\n";
  else
    cout << minn << " " << maxx << "\n";
  return 0;
}

### Prompt

Your task is to create 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 m, int s) { return s >= 0 && s <= 9 * m; }
int main() {
  int m, s;
  cin >> m >> s;
  if (m == 1 && s == 0) {
    cout << "0 0\n";
    return 0;
  } else if (m > 1 && s == 0) {
    cout << "-1 -1\n";
    return 0;
  }
  string minn, maxx;
  int sum = s;
  for (int i = 0; i < m; ++i) {
    for (int d = 0; d < 10; ++d) {
      if (i == 0 && d == 0) continue;
      if (can(m - i - 1, sum - d)) {
        minn += (char)('0' + d);
        sum -= d;
        break;
      }
    }
  }
  sum = s;
  for (int i = 0; i < m; ++i) {
    for (int d = 9; d >= 0; --d) {
      if (i == 0 && d == 0) continue;
      if (can(m - i - 1, sum - d)) {
        maxx += (char)('0' + d);
        sum -= d;
        break;
      }
    }
  }
  if (minn == "" || maxx == "")
    cout << "-1 -1\n";
  else
    cout << minn << " " << maxx << "\n";
  return 0;
}

```