#include <bits/stdc++.h>
using namespace std;
std::vector<int> v1;
std::vector<int> v2;
int main() {
  std::ios::sync_with_stdio(false);
  int m, s;
  cin >> m >> s;
  if (s == 0 && m == 1) {
    cout << "0 0";
    return 0;
  }
  if ((s == 0) || (s > m * 9)) {
    cout << "-1 -1" << '\n';
    return 0;
  }
  long long int sum = s;
  for (int i = 0; i < m; i++) {
    if (sum >= 9) {
      v1.push_back(9);
      sum = sum - 9;
    } else {
      v1.push_back(sum);
      sum = 0;
    }
  }
  sum = s - 1;
  v2.push_back(1);
  for (int i = 0; i < m; i++) {
    if (sum >= 9) {
      v2.push_back(9);
      sum = sum - 9;
    } else {
      v2.push_back(sum);
      sum = 0;
    }
  }
  v2[0] = v2[0] + v2[m];
  v2.pop_back();
  cout << v2[0];
  for (int i = v2.size() - 1; i > 0; i--) cout << v2[i];
  cout << ' ';
  for (int i = 0; i < m; i++) cout << v1[i];
  return 0;
}

### Prompt

Please formulate 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;
std::vector<int> v1;
std::vector<int> v2;
int main() {
  std::ios::sync_with_stdio(false);
  int m, s;
  cin >> m >> s;
  if (s == 0 && m == 1) {
    cout << "0 0";
    return 0;
  }
  if ((s == 0) || (s > m * 9)) {
    cout << "-1 -1" << '\n';
    return 0;
  }
  long long int sum = s;
  for (int i = 0; i < m; i++) {
    if (sum >= 9) {
      v1.push_back(9);
      sum = sum - 9;
    } else {
      v1.push_back(sum);
      sum = 0;
    }
  }
  sum = s - 1;
  v2.push_back(1);
  for (int i = 0; i < m; i++) {
    if (sum >= 9) {
      v2.push_back(9);
      sum = sum - 9;
    } else {
      v2.push_back(sum);
      sum = 0;
    }
  }
  v2[0] = v2[0] + v2[m];
  v2.pop_back();
  cout << v2[0];
  for (int i = v2.size() - 1; i > 0; i--) cout << v2[i];
  cout << ' ';
  for (int i = 0; i < m; i++) cout << v1[i];
  return 0;
}

```