#include <bits/stdc++.h>
using namespace std;
int main() {
  int m, s, sm = 0, cnt = 0;
  string mx, mi;
  cin >> m >> s;
  if (m == 1 && s == 0)
    cout << "0 0" << endl;
  else if (m * 9 < s || s == 0)
    cout << "-1 -1" << endl;
  else {
    while (sm + 9 <= s) {
      sm += 9;
      mx += '9';
      cnt++;
    }
    if (cnt == m) goto hi;
    mx += (s - sm) + '0';
    cnt++;
    while (cnt < m) {
      mx += '0';
      cnt++;
    }
  hi:
    sm = 0;
    cnt = 0;
    s--;
    while (sm + 9 <= s) {
      sm = 9 + sm;
      mi = '9' + mi;
      cnt++;
    }
    if (cnt == m) goto en;
    mi = char((s - sm) + '0') + mi;
    cnt++;
    while (cnt < m - 1) {
      mi = '0' + mi;
      cnt++;
    }
    if (cnt == m) {
      mi[0]++;
      goto en;
    }
    mi = '1' + mi;
  en:
    cout << mi << " " << mx << endl;
  }
  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() {
  int m, s, sm = 0, cnt = 0;
  string mx, mi;
  cin >> m >> s;
  if (m == 1 && s == 0)
    cout << "0 0" << endl;
  else if (m * 9 < s || s == 0)
    cout << "-1 -1" << endl;
  else {
    while (sm + 9 <= s) {
      sm += 9;
      mx += '9';
      cnt++;
    }
    if (cnt == m) goto hi;
    mx += (s - sm) + '0';
    cnt++;
    while (cnt < m) {
      mx += '0';
      cnt++;
    }
  hi:
    sm = 0;
    cnt = 0;
    s--;
    while (sm + 9 <= s) {
      sm = 9 + sm;
      mi = '9' + mi;
      cnt++;
    }
    if (cnt == m) goto en;
    mi = char((s - sm) + '0') + mi;
    cnt++;
    while (cnt < m - 1) {
      mi = '0' + mi;
      cnt++;
    }
    if (cnt == m) {
      mi[0]++;
      goto en;
    }
    mi = '1' + mi;
  en:
    cout << mi << " " << mx << endl;
  }
  return 0;
}

```