#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int m, s;
  cin >> m >> s;
  int small[110] = {0};
  small[1] = 1;
  int x = s - 1;
  int flag = 1;
  for (int i = m; i >= 1; i--) {
    if (i == 1 && x >= 9) {
      flag = 0;
      break;
    }
    if (x >= 9) {
      small[i] += 9;
      x -= 9;
    } else {
      small[i] += x;
      break;
    }
  }
  int large[110] = {0};
  x = s;
  for (int i = 1; i <= m; i++) {
    if (x > 9 && i == m) {
      flag = 0;
      break;
    }
    if (x >= 9) {
      large[i] += 9;
      x -= 9;
    } else {
      large[i] += x;
      break;
    }
  }
  if (m >= 2 && s == 0) flag = 0;
  if (flag) {
    for (int i = 1; i <= m; i++) cout << small[i];
    cout << ' ';
    for (int i = 1; i <= m; i++) cout << large[i];
    cout << endl;
  } else
    cout << -1 << ' ' << -1 << endl;
  return 0;
}

### Prompt

Please provide a cpp coded solution 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() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int m, s;
  cin >> m >> s;
  int small[110] = {0};
  small[1] = 1;
  int x = s - 1;
  int flag = 1;
  for (int i = m; i >= 1; i--) {
    if (i == 1 && x >= 9) {
      flag = 0;
      break;
    }
    if (x >= 9) {
      small[i] += 9;
      x -= 9;
    } else {
      small[i] += x;
      break;
    }
  }
  int large[110] = {0};
  x = s;
  for (int i = 1; i <= m; i++) {
    if (x > 9 && i == m) {
      flag = 0;
      break;
    }
    if (x >= 9) {
      large[i] += 9;
      x -= 9;
    } else {
      large[i] += x;
      break;
    }
  }
  if (m >= 2 && s == 0) flag = 0;
  if (flag) {
    for (int i = 1; i <= m; i++) cout << small[i];
    cout << ' ';
    for (int i = 1; i <= m; i++) cout << large[i];
    cout << endl;
  } else
    cout << -1 << ' ' << -1 << endl;
  return 0;
}

```