#include <bits/stdc++.h>
using namespace std;
int m, k;
int a[105], b[105];
int main() {
  cin >> m >> k;
  if (m * 9 < k) {
    cout << -1 << ' ' << -1 << endl;
    return 0;
  }
  if (k == 0) {
    if (m == 1) {
      cout << 0 << ' ' << 0 << endl;
    } else {
      cout << -1 << ' ' << -1 << endl;
    }
    return 0;
  }
  int tk = k;
  for (int i = m; i > 0; i--) {
    if (tk >= 9) {
      a[i] = 9;
      tk -= 9;
    } else {
      a[i] = tk;
      tk -= a[i];
    }
  }
  if ((m - 1) * 9 >= k - 1) {
    b[m] = 1;
  } else {
    b[m] = k - (m - 1) * 9;
  }
  tk = k - b[m];
  for (int i = m - 1; i > 0; i--) {
    if ((i - 1) * 9 > tk) {
      b[i] = 0;
    } else {
      b[i] = tk - (i - 1) * 9;
      tk -= b[i];
    }
  }
  for (int i = m; i > 0; i--) {
    cout << b[i];
  }
  cout << ' ';
  for (int i = m; i > 0; i--) {
    cout << a[i];
  }
  cout << endl;
  return 0;
}

### Prompt

Create a solution in CPP for 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 m, k;
int a[105], b[105];
int main() {
  cin >> m >> k;
  if (m * 9 < k) {
    cout << -1 << ' ' << -1 << endl;
    return 0;
  }
  if (k == 0) {
    if (m == 1) {
      cout << 0 << ' ' << 0 << endl;
    } else {
      cout << -1 << ' ' << -1 << endl;
    }
    return 0;
  }
  int tk = k;
  for (int i = m; i > 0; i--) {
    if (tk >= 9) {
      a[i] = 9;
      tk -= 9;
    } else {
      a[i] = tk;
      tk -= a[i];
    }
  }
  if ((m - 1) * 9 >= k - 1) {
    b[m] = 1;
  } else {
    b[m] = k - (m - 1) * 9;
  }
  tk = k - b[m];
  for (int i = m - 1; i > 0; i--) {
    if ((i - 1) * 9 > tk) {
      b[i] = 0;
    } else {
      b[i] = tk - (i - 1) * 9;
      tk -= b[i];
    }
  }
  for (int i = m; i > 0; i--) {
    cout << b[i];
  }
  cout << ' ';
  for (int i = m; i > 0; i--) {
    cout << a[i];
  }
  cout << endl;
  return 0;
}

```