#include <bits/stdc++.h>
using namespace std;
int main() {
  int m, s;
  cin >> m >> s;
  int scopy = s;
  string min = "";
  string max = "";
  if (m == 1 && s == 0) {
    cout << "0 0";
    return 0;
  }
  if ((s < 1 && m > 0) || s > m * 9) {
    cout << "-1 -1";
    return 0;
  }
  for (int i = 1; i <= m; i++) {
    for (int j = 0; j <= 9; j++) {
      if (i == 1 && j == 0) j = 1;
      if (j + ((m - i) * 9) >= s) {
        min += to_string(j);
        s -= j;
        break;
      }
    }
  }
  for (int i = 1; i <= m; i++) {
    for (int j = 9; j >= 0; j--) {
      if (j <= scopy) {
        max += to_string(j);
        scopy -= j;
        break;
      }
    }
  }
  cout << min << ' ' << max;
  return 0;
}

### Prompt

Create a solution in Cpp for 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 main() {
  int m, s;
  cin >> m >> s;
  int scopy = s;
  string min = "";
  string max = "";
  if (m == 1 && s == 0) {
    cout << "0 0";
    return 0;
  }
  if ((s < 1 && m > 0) || s > m * 9) {
    cout << "-1 -1";
    return 0;
  }
  for (int i = 1; i <= m; i++) {
    for (int j = 0; j <= 9; j++) {
      if (i == 1 && j == 0) j = 1;
      if (j + ((m - i) * 9) >= s) {
        min += to_string(j);
        s -= j;
        break;
      }
    }
  }
  for (int i = 1; i <= m; i++) {
    for (int j = 9; j >= 0; j--) {
      if (j <= scopy) {
        max += to_string(j);
        scopy -= j;
        break;
      }
    }
  }
  cout << min << ' ' << max;
  return 0;
}

```