#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, s;
  cin >> n >> s;
  if ((n > 1 && s == 0) || (s > 9 * n))
    cout << "-1"
         << " "
         << "-1" << endl;
  else if (n == 1 && s == 0)
    cout << '0' << " " << '0';
  else {
    string str = "", r = "", t = "";
    int x = s / 9;
    int y = s % 9;
    for (int i = 0; i < x; i++) {
      str += '9';
    }
    if (x < n) {
      str += char(y + 48);
      for (int i = x + 1; i < n; i++) str += '0';
    }
    for (int i = 0; i < x; i++) {
      r += '9';
    }
    if (x < n) {
      r += char(y + 48);
      for (int i = x + 1; i < n; i++) {
        r += '0';
      }
    }
    if (r[n - 1] == '0') {
      if (r[x] == '0') {
        r[x - 1] = '8';
        r[n - 1] = '1';
      } else {
        r[x] = char((y - 1) + 48);
        r[n - 1] = '1';
      }
    }
    reverse(r.begin(), r.end());
    cout << r << " " << str;
  }
}

### Prompt

Develop a solution in Cpp to the problem described below:

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 n, s;
  cin >> n >> s;
  if ((n > 1 && s == 0) || (s > 9 * n))
    cout << "-1"
         << " "
         << "-1" << endl;
  else if (n == 1 && s == 0)
    cout << '0' << " " << '0';
  else {
    string str = "", r = "", t = "";
    int x = s / 9;
    int y = s % 9;
    for (int i = 0; i < x; i++) {
      str += '9';
    }
    if (x < n) {
      str += char(y + 48);
      for (int i = x + 1; i < n; i++) str += '0';
    }
    for (int i = 0; i < x; i++) {
      r += '9';
    }
    if (x < n) {
      r += char(y + 48);
      for (int i = x + 1; i < n; i++) {
        r += '0';
      }
    }
    if (r[n - 1] == '0') {
      if (r[x] == '0') {
        r[x - 1] = '8';
        r[n - 1] = '1';
      } else {
        r[x] = char((y - 1) + 48);
        r[n - 1] = '1';
      }
    }
    reverse(r.begin(), r.end());
    cout << r << " " << str;
  }
}

```