#include <bits/stdc++.h>
using namespace std;
int s, m;
string a, b;
int main() {
  scanf("%d %d", &m, &s);
  a = b = "1";
  for (int i = 1; i <= m - 1; ++i) a += "0", b += "0";
  int s1 = s;
  if (s == 0 && m == 1) {
    puts("0 0");
    return 0;
  }
  if (s == 0 || s > m * 9) {
    puts("-1 -1");
    return 0;
  }
  while (s > 1) {
    for (int i = m - 1; i >= 0; --i)
      if (a[i] < '9') {
        ++a[i];
        --s;
        break;
      }
  }
  while (s1 > 1) {
    for (int i = 0; i <= m - 1; ++i)
      if (b[i] < '9') {
        ++b[i];
        --s1;
        break;
      }
  }
  cout << a << " " << b << endl;
  return 0;
}

### Prompt

Generate 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;
int s, m;
string a, b;
int main() {
  scanf("%d %d", &m, &s);
  a = b = "1";
  for (int i = 1; i <= m - 1; ++i) a += "0", b += "0";
  int s1 = s;
  if (s == 0 && m == 1) {
    puts("0 0");
    return 0;
  }
  if (s == 0 || s > m * 9) {
    puts("-1 -1");
    return 0;
  }
  while (s > 1) {
    for (int i = m - 1; i >= 0; --i)
      if (a[i] < '9') {
        ++a[i];
        --s;
        break;
      }
  }
  while (s1 > 1) {
    for (int i = 0; i <= m - 1; ++i)
      if (b[i] < '9') {
        ++b[i];
        --s1;
        break;
      }
  }
  cout << a << " " << b << endl;
  return 0;
}

```