#include <bits/stdc++.h>
using namespace std;
int main() {
  int m, s, i, k;
  cin >> m >> s;
  if (s < 1 && m > 1 || s > m * 9)
    cout << -1 << ' ' << -1 << endl;
  else {
    for (i = m - 1, k = s; i >= 0; i--) {
      int j = max(0, k - 9 * i);
      if (j == 0 && i == m - 1 && k) j = 1;
      cout << j;
      k -= j;
    }
    cout << ' ';
    for (i = m - 1, k = s; i >= 0; i--) {
      int j = min(9, k);
      cout << j;
      k -= j;
    }
  }
}

### Prompt

In CPP, your task is to solve 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, i, k;
  cin >> m >> s;
  if (s < 1 && m > 1 || s > m * 9)
    cout << -1 << ' ' << -1 << endl;
  else {
    for (i = m - 1, k = s; i >= 0; i--) {
      int j = max(0, k - 9 * i);
      if (j == 0 && i == m - 1 && k) j = 1;
      cout << j;
      k -= j;
    }
    cout << ' ';
    for (i = m - 1, k = s; i >= 0; i--) {
      int j = min(9, k);
      cout << j;
      k -= j;
    }
  }
}

```