#include <bits/stdc++.h>
using namespace std;
int main() {
  int m, s;
  cin >> m >> s;
  vector<char> min;
  if (m == 1 && s == 0)
    cout << "0 0 " << endl;
  else if (m * 9 >= s && s > 0) {
    int copy = s;
    string max;
    for (int i = 0; i < m; i++) {
      if (s >= 9) {
        min.insert(min.begin(), '9');
        s -= 9;
      } else if (s != 0) {
        min.insert(min.begin(), '0' + s);
        s = 0;
      } else {
        min.insert(min.begin(), '0');
      }
    }
    for (int i = 1; i < m; i++) {
      if (min[i - 1] == '0' && min[i] != '0') {
        --min[i];
        min[0]++;
        break;
      }
    }
    for (int i = 0; i < m; i++) cout << min[i];
    cout << " ";
    s = copy;
    for (int i = 0; i < m; i++) {
      if (s >= 9) {
        max += '9';
        s -= 9;
      } else if (s != 0) {
        max += '0' + s;
        s = 0;
      } else
        max += '0';
    }
    cout << max << endl;
  } else
    cout << "-1 -1" << endl;
}

### Prompt

Please formulate 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 m, s;
  cin >> m >> s;
  vector<char> min;
  if (m == 1 && s == 0)
    cout << "0 0 " << endl;
  else if (m * 9 >= s && s > 0) {
    int copy = s;
    string max;
    for (int i = 0; i < m; i++) {
      if (s >= 9) {
        min.insert(min.begin(), '9');
        s -= 9;
      } else if (s != 0) {
        min.insert(min.begin(), '0' + s);
        s = 0;
      } else {
        min.insert(min.begin(), '0');
      }
    }
    for (int i = 1; i < m; i++) {
      if (min[i - 1] == '0' && min[i] != '0') {
        --min[i];
        min[0]++;
        break;
      }
    }
    for (int i = 0; i < m; i++) cout << min[i];
    cout << " ";
    s = copy;
    for (int i = 0; i < m; i++) {
      if (s >= 9) {
        max += '9';
        s -= 9;
      } else if (s != 0) {
        max += '0' + s;
        s = 0;
      } else
        max += '0';
    }
    cout << max << endl;
  } else
    cout << "-1 -1" << endl;
}

```