#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int m, s;
  cin >> m >> s;
  int* arr = new int[m];
  int buff;
  buff = s;
  if ((s == 0 && m != 1) || s > m * 9) {
    cout << "-1 -1" << endl;
    return 0;
  }
  for (int i = m - 1; i >= 0; i--) {
    if (buff > 9) {
      arr[i] = 9;
      buff -= 9;
    } else {
      if (i == 0)
        arr[i] = buff;
      else {
        arr[i] = buff - 1;
        for (int j = i - 1; j > 0; j--) {
          arr[j] = 0;
        }
        arr[0] = 1;
      }
      break;
    }
  }
  for (int i = 0; i < m; i++) {
    cout << arr[i];
  }
  cout << " ";
  buff = s;
  for (int i = 0; i < m; i++) {
    if (buff > 9) {
      arr[i] = 9;
      buff -= 9;
    } else {
      arr[i] = buff;
      for (int j = i + 1; j < m; j++) arr[j] = 0;
      break;
    }
  }
  for (int i = 0; i < m; i++) {
    cout << arr[i];
  }
  return 0;
}

### Prompt

Generate 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 main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int m, s;
  cin >> m >> s;
  int* arr = new int[m];
  int buff;
  buff = s;
  if ((s == 0 && m != 1) || s > m * 9) {
    cout << "-1 -1" << endl;
    return 0;
  }
  for (int i = m - 1; i >= 0; i--) {
    if (buff > 9) {
      arr[i] = 9;
      buff -= 9;
    } else {
      if (i == 0)
        arr[i] = buff;
      else {
        arr[i] = buff - 1;
        for (int j = i - 1; j > 0; j--) {
          arr[j] = 0;
        }
        arr[0] = 1;
      }
      break;
    }
  }
  for (int i = 0; i < m; i++) {
    cout << arr[i];
  }
  cout << " ";
  buff = s;
  for (int i = 0; i < m; i++) {
    if (buff > 9) {
      arr[i] = 9;
      buff -= 9;
    } else {
      arr[i] = buff;
      for (int j = i + 1; j < m; j++) arr[j] = 0;
      break;
    }
  }
  for (int i = 0; i < m; i++) {
    cout << arr[i];
  }
  return 0;
}

```