#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int m, s;
  cin >> m >> s;
  if (s == 0) {
    if (m == 1) {
      cout << "0 0\n";
    } else {
      cout << "-1 -1\n";
    }
    return 0;
  }
  if (s > 9 * m) {
    cout << "-1 -1\n";
    return 0;
  }
  int mins = s;
  string min_num;
  for (int i = 0; i < m; i++) {
    int lo = (i == 0) ? 1 : 0;
    int x = 9;
    while (x > lo) {
      int max_can_form = 9 * (m - i - 1);
      int after = mins - (x - 1);
      if (after > max_can_form) {
        break;
      }
      x--;
    }
    mins -= x;
    min_num += to_string(x);
  }
  int maxs = s;
  string max_num;
  for (int i = 0; i < m; i++) {
    int lo = (i == 0) ? 1 : 0;
    int x = 10;
    while (x > lo) {
      x--;
      int max_can_form = 9 * (m - i - 1);
      int after = maxs - x;
      if (after >= 0 && after <= max_can_form) {
        break;
      }
    }
    maxs -= x;
    max_num += to_string(x);
  }
  cout << min_num << ' ' << max_num << '\n';
  return 0;
}

### Prompt

In cpp, your task is to solve 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(false);
  cin.tie(0);
  int m, s;
  cin >> m >> s;
  if (s == 0) {
    if (m == 1) {
      cout << "0 0\n";
    } else {
      cout << "-1 -1\n";
    }
    return 0;
  }
  if (s > 9 * m) {
    cout << "-1 -1\n";
    return 0;
  }
  int mins = s;
  string min_num;
  for (int i = 0; i < m; i++) {
    int lo = (i == 0) ? 1 : 0;
    int x = 9;
    while (x > lo) {
      int max_can_form = 9 * (m - i - 1);
      int after = mins - (x - 1);
      if (after > max_can_form) {
        break;
      }
      x--;
    }
    mins -= x;
    min_num += to_string(x);
  }
  int maxs = s;
  string max_num;
  for (int i = 0; i < m; i++) {
    int lo = (i == 0) ? 1 : 0;
    int x = 10;
    while (x > lo) {
      x--;
      int max_can_form = 9 * (m - i - 1);
      int after = maxs - x;
      if (after >= 0 && after <= max_can_form) {
        break;
      }
    }
    maxs -= x;
    max_num += to_string(x);
  }
  cout << min_num << ' ' << max_num << '\n';
  return 0;
}

```