#include <bits/stdc++.h>
using namespace std;
int main() {
  std::ios::sync_with_stdio(false);
  int m, s;
  cin >> m >> s;
  if (s > m * 9 || m > 1 && s < 1)
    cout << "-1 -1";
  else {
    int a = s, b = s, index = m - 1;
    while (index >= 0) {
      int pos;
      pos = max(0, a - 9 * index);
      if (index == m - 1 && a && pos == 0) pos = 1;
      cout << pos;
      index--;
      a -= pos;
    }
    cout << ' ';
    index = m;
    while (index != 0) {
      int pos;
      pos = min(9, b);
      cout << pos;
      index--;
      b -= pos;
    }
  }
  return 0;
}

### Prompt

Please create a solution in cpp 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() {
  std::ios::sync_with_stdio(false);
  int m, s;
  cin >> m >> s;
  if (s > m * 9 || m > 1 && s < 1)
    cout << "-1 -1";
  else {
    int a = s, b = s, index = m - 1;
    while (index >= 0) {
      int pos;
      pos = max(0, a - 9 * index);
      if (index == m - 1 && a && pos == 0) pos = 1;
      cout << pos;
      index--;
      a -= pos;
    }
    cout << ' ';
    index = m;
    while (index != 0) {
      int pos;
      pos = min(9, b);
      cout << pos;
      index--;
      b -= pos;
    }
  }
  return 0;
}

```