#include <bits/stdc++.h>
using namespace std;
string rev(string str) {
  string res = "";
  for (int i = str.length() - 1; i > -1; i--) {
    res += str[i];
  }
  return res;
}
int main() {
  int m, s;
  cin >> m >> s;
  string str = "", rts = "";
  if (s == 0 && m == 1) {
    cout << "0 0" << endl;
    return 0;
  }
  if (s == 0 || s > m * 9) {
    cout << "-1 -1" << endl;
    return 0;
  }
  for (int i = 0; i < m; i++) {
    str += "0";
  }
  rts = str;
  for (int i = m - 1; i > -1 && s > 0; i--) {
    if (s > 9) {
      str[i] = '9';
      rts[m - i - 1] = '9';
      s -= 9;
      continue;
    }
    if (i > 0) {
      str[0] += 1;
      rts[m - i - 1] += 1;
      s--;
    }
    str[i] += s;
    rts[m - i - 1] += s;
    s = 0;
  }
  cout << str << " " << rts << endl;
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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;
string rev(string str) {
  string res = "";
  for (int i = str.length() - 1; i > -1; i--) {
    res += str[i];
  }
  return res;
}
int main() {
  int m, s;
  cin >> m >> s;
  string str = "", rts = "";
  if (s == 0 && m == 1) {
    cout << "0 0" << endl;
    return 0;
  }
  if (s == 0 || s > m * 9) {
    cout << "-1 -1" << endl;
    return 0;
  }
  for (int i = 0; i < m; i++) {
    str += "0";
  }
  rts = str;
  for (int i = m - 1; i > -1 && s > 0; i--) {
    if (s > 9) {
      str[i] = '9';
      rts[m - i - 1] = '9';
      s -= 9;
      continue;
    }
    if (i > 0) {
      str[0] += 1;
      rts[m - i - 1] += 1;
      s--;
    }
    str[i] += s;
    rts[m - i - 1] += s;
    s = 0;
  }
  cout << str << " " << rts << endl;
  return 0;
}

```