#include <bits/stdc++.h>
using namespace std;
int M, S, T, i, j;
string mins, maks;
int main() {
  cin >> M >> S;
  if (M == 1 && S < 10) {
    cout << S << " " << S << endl;
  } else if (9 * M < S || S < 1) {
    cout << -1 << " " << -1 << endl;
  } else {
    T = S;
    mins = (char)(max(1, T - 9 * (M - 1)) + (int)'0');
    T = T - (int)(mins[0] - '0');
    for (i = 2; i <= M; i++) {
      if (T > 9 * (M - i)) {
        mins = mins + (char)(T - 9 * (M - i) + (int)'0');
        T = 9 * (M - i);
      } else
        mins = mins + '0';
    }
    T = S;
    maks = "";
    for (i = 0; i < M; i++) {
      if (T > 9) {
        maks = maks + '9';
        T = T - 9;
      } else if (T > 0) {
        maks = maks + (char)(T + (int)'0');
        T = 0;
      } else
        maks = maks + '0';
    }
    cout << mins << " " << maks << endl;
  }
}

### 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 M, S, T, i, j;
string mins, maks;
int main() {
  cin >> M >> S;
  if (M == 1 && S < 10) {
    cout << S << " " << S << endl;
  } else if (9 * M < S || S < 1) {
    cout << -1 << " " << -1 << endl;
  } else {
    T = S;
    mins = (char)(max(1, T - 9 * (M - 1)) + (int)'0');
    T = T - (int)(mins[0] - '0');
    for (i = 2; i <= M; i++) {
      if (T > 9 * (M - i)) {
        mins = mins + (char)(T - 9 * (M - i) + (int)'0');
        T = 9 * (M - i);
      } else
        mins = mins + '0';
    }
    T = S;
    maks = "";
    for (i = 0; i < M; i++) {
      if (T > 9) {
        maks = maks + '9';
        T = T - 9;
      } else if (T > 0) {
        maks = maks + (char)(T + (int)'0');
        T = 0;
      } else
        maks = maks + '0';
    }
    cout << mins << " " << maks << endl;
  }
}

```