#include <bits/stdc++.h>
using namespace std;
void collect_digits(std::vector<long long>* digits, unsigned long num) {
  if (num > 9) {
    collect_digits(digits, num / 10);
  }
  digits->push_back(num % 10);
}
int main(void) {
  long m, s;
  cin >> m >> s;
  if (m == 1 && s > 9 || s == 0 && m > 1) {
    cout << "-1 -1";
    exit(0);
  }
  if (m == 1 && s < 10) {
    cout << s << " " << s;
    exit(0);
  }
  string max;
  int subS = s;
  for (int i = 0; i < m; i++) {
    if (subS >= 9) {
      max.push_back('9');
      subS -= 9;
    } else if (subS < 9) {
      max.push_back(std::to_string(subS)[0]);
      subS -= subS;
    }
  }
  if (subS != 0) {
    cout << "-1 -1";
    exit(0);
  }
  string min = max;
  std::reverse(min.begin(), min.end());
  if (min[0] == '0') {
    min[0] = '1';
    for (int i = 1; i < m; i++) {
      if (min[i] != '0') {
        min[i] = char(int(min[i]) - 1);
        break;
      }
    }
  }
  cout << min << " " << max;
  return 0;
}

### Prompt

Your task is to create a CPP solution to 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;
void collect_digits(std::vector<long long>* digits, unsigned long num) {
  if (num > 9) {
    collect_digits(digits, num / 10);
  }
  digits->push_back(num % 10);
}
int main(void) {
  long m, s;
  cin >> m >> s;
  if (m == 1 && s > 9 || s == 0 && m > 1) {
    cout << "-1 -1";
    exit(0);
  }
  if (m == 1 && s < 10) {
    cout << s << " " << s;
    exit(0);
  }
  string max;
  int subS = s;
  for (int i = 0; i < m; i++) {
    if (subS >= 9) {
      max.push_back('9');
      subS -= 9;
    } else if (subS < 9) {
      max.push_back(std::to_string(subS)[0]);
      subS -= subS;
    }
  }
  if (subS != 0) {
    cout << "-1 -1";
    exit(0);
  }
  string min = max;
  std::reverse(min.begin(), min.end());
  if (min[0] == '0') {
    min[0] = '1';
    for (int i = 1; i < m; i++) {
      if (min[i] != '0') {
        min[i] = char(int(min[i]) - 1);
        break;
      }
    }
  }
  cout << min << " " << max;
  return 0;
}

```