#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, s, i, j, k, l, x;
  int arr[105];
  int arr1[105];
  cin >> m >> s;
  l = m * 9;
  if (m > 1 && s == 0) {
    cout << "-1"
         << " "
         << "-1" << endl;
  } else if (s > l) {
    cout << "-1"
         << " "
         << "-1" << endl;
  } else if (m == 1 && s == 0) {
    cout << "0"
         << " "
         << "0" << endl;
  } else {
    x = s;
    for (i = 1; i <= m; i++) {
      if (s >= 9) {
        arr[i] = 9;
        s = s - 9;
      } else if (s == 0) {
        arr[i] = 0;
      } else {
        arr[i] = s;
        s = 0;
      }
    }
    for (i = m; i >= 1; i--) {
      if (x > 9) {
        arr1[i] = 9;
        x = x - 9;
      } else if (x == 1 && i > 1) {
        arr1[i] = 0;
      } else if (x <= 9 && i > 1) {
        x = x - 1;
        arr1[i] = x;
        x = 1;
      } else if (i == 1) {
        arr1[i] = x;
      }
    }
    for (i = 1; i <= m; i++) {
      cout << arr1[i];
    }
    cout << " ";
    for (i = 1; i <= m; i++) {
      cout << arr[i];
    }
    cout << endl;
  }
  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 main() {
  int n, m, s, i, j, k, l, x;
  int arr[105];
  int arr1[105];
  cin >> m >> s;
  l = m * 9;
  if (m > 1 && s == 0) {
    cout << "-1"
         << " "
         << "-1" << endl;
  } else if (s > l) {
    cout << "-1"
         << " "
         << "-1" << endl;
  } else if (m == 1 && s == 0) {
    cout << "0"
         << " "
         << "0" << endl;
  } else {
    x = s;
    for (i = 1; i <= m; i++) {
      if (s >= 9) {
        arr[i] = 9;
        s = s - 9;
      } else if (s == 0) {
        arr[i] = 0;
      } else {
        arr[i] = s;
        s = 0;
      }
    }
    for (i = m; i >= 1; i--) {
      if (x > 9) {
        arr1[i] = 9;
        x = x - 9;
      } else if (x == 1 && i > 1) {
        arr1[i] = 0;
      } else if (x <= 9 && i > 1) {
        x = x - 1;
        arr1[i] = x;
        x = 1;
      } else if (i == 1) {
        arr1[i] = x;
      }
    }
    for (i = 1; i <= m; i++) {
      cout << arr1[i];
    }
    cout << " ";
    for (i = 1; i <= m; i++) {
      cout << arr[i];
    }
    cout << endl;
  }
  return 0;
}

```