#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, i, t, j, s, x, y, z;
  cin >> n >> s;
  if (n == 1 && s >= 0 && s <= 9) {
    cout << s << " " << s;
    return 0;
  }
  if (s == (n * 9)) {
    for (i = 0; i < (s / 9); i++) {
      cout << "9";
    }
    cout << " ";
    for (i = 0; i < (s / 9); i++) {
      cout << "9";
    }
    return 0;
  }
  if (s >= 1 && s <= (n * 9) && n >= 2) {
    if ((9 * (n - 1) + 1) >= s) {
      cout << "1";
      for (i = 0; i < ((n - 2) - ((s - 1) / 9)); i++) cout << "0";
      if (n > i + 1 + ((s - 1) / 9)) cout << (s - 1) % 9;
      for (i = 0; i < ((s - 1) / 9); i++) cout << "9";
    } else {
      cout << (s % 9);
      for (i = 0; i < (s / 9); i++) cout << "9";
    }
    cout << " ";
    x = (s / 9);
    y = (s % 9);
    for (i = 1; i <= x; i++) {
      cout << "9";
    }
    cout << y;
    for (j = i + 1; j <= n; j++) {
      cout << "0";
    }
  } else
    cout << "-1 -1";
}

### 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() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, i, t, j, s, x, y, z;
  cin >> n >> s;
  if (n == 1 && s >= 0 && s <= 9) {
    cout << s << " " << s;
    return 0;
  }
  if (s == (n * 9)) {
    for (i = 0; i < (s / 9); i++) {
      cout << "9";
    }
    cout << " ";
    for (i = 0; i < (s / 9); i++) {
      cout << "9";
    }
    return 0;
  }
  if (s >= 1 && s <= (n * 9) && n >= 2) {
    if ((9 * (n - 1) + 1) >= s) {
      cout << "1";
      for (i = 0; i < ((n - 2) - ((s - 1) / 9)); i++) cout << "0";
      if (n > i + 1 + ((s - 1) / 9)) cout << (s - 1) % 9;
      for (i = 0; i < ((s - 1) / 9); i++) cout << "9";
    } else {
      cout << (s % 9);
      for (i = 0; i < (s / 9); i++) cout << "9";
    }
    cout << " ";
    x = (s / 9);
    y = (s % 9);
    for (i = 1; i <= x; i++) {
      cout << "9";
    }
    cout << y;
    for (j = i + 1; j <= n; j++) {
      cout << "0";
    }
  } else
    cout << "-1 -1";
}

```