#include <bits/stdc++.h>
using namespace std;
int main() {
  int l, s;
  cin >> l >> s;
  if (l == 1 && !s) {
    cout << "0 0";
    return 0;
  }
  if (!s || s > l * 9) {
    cout << "-1 -1";
    return 0;
  }
  int dff = s;
  string mn, mx;
  for (int i = 0; i < l; i++) {
    if (dff - 9 >= 0) {
      mx += "9";
      dff -= 9;
    } else {
      mx += dff + '0';
      dff = 0;
    }
  }
  mn = mx;
  reverse(mn.begin(), mn.end());
  if (mn[0] == '0') {
    for (int i = 0; i < l; i++)
      if (mn[i] != '0') {
        mn[i] -= 1;
        break;
      }
    mn[0] = '1';
  }
  cout << mn << " " << mx;
  return 0;
}

### Prompt

Your challenge is to write 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() {
  int l, s;
  cin >> l >> s;
  if (l == 1 && !s) {
    cout << "0 0";
    return 0;
  }
  if (!s || s > l * 9) {
    cout << "-1 -1";
    return 0;
  }
  int dff = s;
  string mn, mx;
  for (int i = 0; i < l; i++) {
    if (dff - 9 >= 0) {
      mx += "9";
      dff -= 9;
    } else {
      mx += dff + '0';
      dff = 0;
    }
  }
  mn = mx;
  reverse(mn.begin(), mn.end());
  if (mn[0] == '0') {
    for (int i = 0; i < l; i++)
      if (mn[i] != '0') {
        mn[i] -= 1;
        break;
      }
    mn[0] = '1';
  }
  cout << mn << " " << mx;
  return 0;
}

```