#include <bits/stdc++.h>
using namespace std;
int main() {
  int m, s;
  cin >> m >> s;
  int temp = s;
  int a[m], b[m];
  int i;
  for (i = 0; i < m; i++) {
    b[i] = 0;
    a[i] = 0;
  }
  if (9 * m < s) {
    cout << "-1 -1";
    return 0;
  }
  if (s < 1) {
    if (s == 0 && m == 1)
      ;
    else {
      cout << "-1 -1";
      return 0;
    }
  }
  for (i = m - 1; i > 0; i--) {
    if (temp > 9) {
      a[i] = 9;
      temp -= 9;
    } else {
      a[i] = temp - 1;
      temp = 1;
      break;
    }
  }
  a[0] = temp;
  for (i = 0; i < m; i++) cout << a[i];
  cout << " ";
  temp = s;
  for (i = 0; i < m; i++) {
    if (temp >= 9) {
      b[i] = 9;
      temp -= 9;
    } else {
      b[i] = temp;
      break;
    }
  }
  for (i = 0; i < m; i++) cout << b[i];
  return 0;
}

### 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 m, s;
  cin >> m >> s;
  int temp = s;
  int a[m], b[m];
  int i;
  for (i = 0; i < m; i++) {
    b[i] = 0;
    a[i] = 0;
  }
  if (9 * m < s) {
    cout << "-1 -1";
    return 0;
  }
  if (s < 1) {
    if (s == 0 && m == 1)
      ;
    else {
      cout << "-1 -1";
      return 0;
    }
  }
  for (i = m - 1; i > 0; i--) {
    if (temp > 9) {
      a[i] = 9;
      temp -= 9;
    } else {
      a[i] = temp - 1;
      temp = 1;
      break;
    }
  }
  a[0] = temp;
  for (i = 0; i < m; i++) cout << a[i];
  cout << " ";
  temp = s;
  for (i = 0; i < m; i++) {
    if (temp >= 9) {
      b[i] = 9;
      temp -= 9;
    } else {
      b[i] = temp;
      break;
    }
  }
  for (i = 0; i < m; i++) cout << b[i];
  return 0;
}

```