#include <bits/stdc++.h>
using namespace std;
int m, s;
string maxi;
string mini;
int main() {
  cin >> m >> s;
  if (m == 1 && s == 0) {
    cout << 0 << " " << 0;
    return 0;
  }
  if (s > 0 && m * 9 >= s) {
    int m1 = m;
    int s1 = s;
    while (m1 > 1) {
      m1--;
      if (s1 > 9) {
        mini += '9';
        s1 -= 9;
      } else if (s1 > 1) {
        mini += '0' + s1 - 1;
        s1 = 1;
      } else {
        mini += '0';
      }
    }
    mini += '0' + s1;
    reverse(mini.begin(), mini.end());
    cout << mini << " ";
  } else {
    cout << "-1 ";
  }
  if (s > 0 && m * 9 >= s) {
    while (m > 0) {
      m--;
      if (s >= 9) {
        maxi += '9';
        s -= 9;
      } else {
        maxi += '0' + s;
        s = 0;
      }
    }
    cout << maxi;
  } else {
    cout << "-1";
  }
  return 0;
}

### Prompt

Your task is to create 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 m, s;
string maxi;
string mini;
int main() {
  cin >> m >> s;
  if (m == 1 && s == 0) {
    cout << 0 << " " << 0;
    return 0;
  }
  if (s > 0 && m * 9 >= s) {
    int m1 = m;
    int s1 = s;
    while (m1 > 1) {
      m1--;
      if (s1 > 9) {
        mini += '9';
        s1 -= 9;
      } else if (s1 > 1) {
        mini += '0' + s1 - 1;
        s1 = 1;
      } else {
        mini += '0';
      }
    }
    mini += '0' + s1;
    reverse(mini.begin(), mini.end());
    cout << mini << " ";
  } else {
    cout << "-1 ";
  }
  if (s > 0 && m * 9 >= s) {
    while (m > 0) {
      m--;
      if (s >= 9) {
        maxi += '9';
        s -= 9;
      } else {
        maxi += '0' + s;
        s = 0;
      }
    }
    cout << maxi;
  } else {
    cout << "-1";
  }
  return 0;
}

```