#include <bits/stdc++.h>
using namespace std;
bool ok(int l, int s) { return s >= 0 && 9 * l >= s; }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, s;
  cin >> n >> s;
  if (s == 0) {
    if (n == 1)
      cout << 0 << " " << 0 << '\n';
    else
      cout << -1 << " " << -1 << '\n';
    return 0;
  }
  if (n * 9 < s) {
    cout << -1 << " " << -1 << '\n';
    return 0;
  }
  int sum = s;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 10; j++) {
      if ((i > 0 || j > 0) && ok(n - i - 1, sum - j)) {
        cout << j;
        sum -= j;
        break;
      }
    }
  }
  cout << " ";
  sum = s;
  for (int i = 0; i < n; i++) {
    for (int j = 9; j >= 0; j--) {
      if ((i > 0 || j > 0) && ok(n - i - 1, sum - j)) {
        cout << j;
        sum -= j;
        break;
      }
    }
  }
  cout << '\n';
  return 0;
}

### Prompt

Generate 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;
bool ok(int l, int s) { return s >= 0 && 9 * l >= s; }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, s;
  cin >> n >> s;
  if (s == 0) {
    if (n == 1)
      cout << 0 << " " << 0 << '\n';
    else
      cout << -1 << " " << -1 << '\n';
    return 0;
  }
  if (n * 9 < s) {
    cout << -1 << " " << -1 << '\n';
    return 0;
  }
  int sum = s;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 10; j++) {
      if ((i > 0 || j > 0) && ok(n - i - 1, sum - j)) {
        cout << j;
        sum -= j;
        break;
      }
    }
  }
  cout << " ";
  sum = s;
  for (int i = 0; i < n; i++) {
    for (int j = 9; j >= 0; j--) {
      if ((i > 0 || j > 0) && ok(n - i - 1, sum - j)) {
        cout << j;
        sum -= j;
        break;
      }
    }
  }
  cout << '\n';
  return 0;
}

```