#include <bits/stdc++.h>
using namespace std;
int main() {
  int s, m;
  cin >> m >> s;
  if (m == 1 and s == 0) {
    cout << 0 << " " << 0;
    return 0;
  }
  int low = 1, high = 9 * m;
  if (s < low or s > high) {
    cout << "-1"
         << " "
         << "-1";
    return 0;
  }
  int have = s;
  for (int i = 0; i < m; i++) {
    int suf = (m - 1 - i) * 9;
    int add = max(i ? 0 : 1, have - suf);
    cout << add;
    have -= add;
  }
  cout << " ";
  have = s;
  for (int i = 0; i < m; i++) {
    int add = min(9, have);
    cout << add;
    have -= add;
  }
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

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 s, m;
  cin >> m >> s;
  if (m == 1 and s == 0) {
    cout << 0 << " " << 0;
    return 0;
  }
  int low = 1, high = 9 * m;
  if (s < low or s > high) {
    cout << "-1"
         << " "
         << "-1";
    return 0;
  }
  int have = s;
  for (int i = 0; i < m; i++) {
    int suf = (m - 1 - i) * 9;
    int add = max(i ? 0 : 1, have - suf);
    cout << add;
    have -= add;
  }
  cout << " ";
  have = s;
  for (int i = 0; i < m; i++) {
    int add = min(9, have);
    cout << add;
    have -= add;
  }
  return 0;
}

```