#include <bits/stdc++.h>
using namespace std;
int main() {
  int m, s;
  cin >> m >> s;
  if (s == 0) {
    if (m == 1) {
      cout << "0 0" << endl;
      return 0;
    } else {
      cout << "-1 -1" << endl;
      return 0;
    }
  }
  string max, mini;
  for (int i = 0; i < m; i++) {
    int t = min(9, s);
    max.push_back(t + '0');
    s -= t;
  }
  if (s > 0) {
    cout << "-1 -1" << endl;
    return 0;
  }
  for (int i = m - 1; i >= 0; i--) {
    mini.push_back(max[i]);
  }
  int j = 0;
  while (mini[j] == '0') {
    j++;
  }
  mini[0]++;
  mini[j]--;
  cout << mini << " " << max << 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;
int main() {
  int m, s;
  cin >> m >> s;
  if (s == 0) {
    if (m == 1) {
      cout << "0 0" << endl;
      return 0;
    } else {
      cout << "-1 -1" << endl;
      return 0;
    }
  }
  string max, mini;
  for (int i = 0; i < m; i++) {
    int t = min(9, s);
    max.push_back(t + '0');
    s -= t;
  }
  if (s > 0) {
    cout << "-1 -1" << endl;
    return 0;
  }
  for (int i = m - 1; i >= 0; i--) {
    mini.push_back(max[i]);
  }
  int j = 0;
  while (mini[j] == '0') {
    j++;
  }
  mini[0]++;
  mini[j]--;
  cout << mini << " " << max << endl;
  return 0;
}

```