#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
  int m, s;
  string large_num = "", small_num = "";
  cin >> m >> s;
  if (s == 0 && m > 1) {
    cout << -1 << " " << -1;
    return 0;
  }
  if (s == 0 && m == 1) {
    cout << 0 << " " << 0;
    return 0;
  }
  int ndigits = 0;
  int sum = 0;
  while (sum < s && ndigits <= m) {
    sum += 9;
    large_num = '9' + large_num;
    ndigits++;
  }
  char lastdigit = '9';
  if (sum > s) {
    large_num.pop_back();
    lastdigit = char(s - sum + 9 + '0');
    large_num = large_num + lastdigit;
  }
  if (ndigits > m) {
    cout << -1 << " " << -1;
    return 0;
  }
  string fin_large = large_num;
  int padding = 0;
  while (ndigits < m) {
    fin_large = fin_large + '0';
    ndigits++;
    padding++;
  }
  for (int i = large_num.length() - 2; i >= 0; i--) {
    small_num = small_num + large_num[i];
  }
  if (padding > 0) {
    int k = int(lastdigit) - 1;
    small_num = char(k) + small_num;
    for (int i = 1; i <= padding - 1; i++) {
      small_num = '0' + small_num;
    }
    small_num = '1' + small_num;
  } else {
    small_num = lastdigit + small_num;
  }
  cout << small_num << " " << fin_large;
  return 0;
}

### Prompt

Please create a solution in cpp 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;
int main(int argc, char const *argv[]) {
  int m, s;
  string large_num = "", small_num = "";
  cin >> m >> s;
  if (s == 0 && m > 1) {
    cout << -1 << " " << -1;
    return 0;
  }
  if (s == 0 && m == 1) {
    cout << 0 << " " << 0;
    return 0;
  }
  int ndigits = 0;
  int sum = 0;
  while (sum < s && ndigits <= m) {
    sum += 9;
    large_num = '9' + large_num;
    ndigits++;
  }
  char lastdigit = '9';
  if (sum > s) {
    large_num.pop_back();
    lastdigit = char(s - sum + 9 + '0');
    large_num = large_num + lastdigit;
  }
  if (ndigits > m) {
    cout << -1 << " " << -1;
    return 0;
  }
  string fin_large = large_num;
  int padding = 0;
  while (ndigits < m) {
    fin_large = fin_large + '0';
    ndigits++;
    padding++;
  }
  for (int i = large_num.length() - 2; i >= 0; i--) {
    small_num = small_num + large_num[i];
  }
  if (padding > 0) {
    int k = int(lastdigit) - 1;
    small_num = char(k) + small_num;
    for (int i = 1; i <= padding - 1; i++) {
      small_num = '0' + small_num;
    }
    small_num = '1' + small_num;
  } else {
    small_num = lastdigit + small_num;
  }
  cout << small_num << " " << fin_large;
  return 0;
}

```