#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int m, n;
  cin >> m >> n;
  int n2 = n;
  if (n > 9 * m || (n == 0 && m > 1) || n < 0) {
    cout << "-1 -1";
    return 0;
  } else if (m == 1 && n == 0) {
    cout << "0 0";
    return 0;
  } else {
    int an[m];
    int bn[m];
    for (int i = 0; i < m; ++i) {
      if (n > 9) {
        an[i] = 9;
      } else {
        an[i] = n;
      }
      n -= an[i];
    }
    for (int i = 0; i < m; ++i) {
      if (i == 0 && n2 - 1 <= (9 * (m - 1))) {
        bn[i] = 1;
      } else {
        if (n2 <= ((m - 1 - i) * 9)) {
          bn[i] = 0;
        } else {
          bn[i] = n2 - ((m - 1 - i) * 9);
        }
      }
      n2 -= bn[i];
    }
    for (int i = 0; i < m; ++i) {
      cout << bn[i];
    }
    cout << " ";
    for (int i = 0; i < m; ++i) {
      cout << an[i];
    }
  }
  return 0;
}

### 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);
  int m, n;
  cin >> m >> n;
  int n2 = n;
  if (n > 9 * m || (n == 0 && m > 1) || n < 0) {
    cout << "-1 -1";
    return 0;
  } else if (m == 1 && n == 0) {
    cout << "0 0";
    return 0;
  } else {
    int an[m];
    int bn[m];
    for (int i = 0; i < m; ++i) {
      if (n > 9) {
        an[i] = 9;
      } else {
        an[i] = n;
      }
      n -= an[i];
    }
    for (int i = 0; i < m; ++i) {
      if (i == 0 && n2 - 1 <= (9 * (m - 1))) {
        bn[i] = 1;
      } else {
        if (n2 <= ((m - 1 - i) * 9)) {
          bn[i] = 0;
        } else {
          bn[i] = n2 - ((m - 1 - i) * 9);
        }
      }
      n2 -= bn[i];
    }
    for (int i = 0; i < m; ++i) {
      cout << bn[i];
    }
    cout << " ";
    for (int i = 0; i < m; ++i) {
      cout << an[i];
    }
  }
  return 0;
}

```