#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, sum;
int a[maxn], b[maxn];
int main() {
  scanf("%d%d", &n, &sum);
  if (sum == 0) {
    if (n == 1)
      printf("0 0\n");
    else
      printf("-1 -1\n");
    return 0;
  }
  if (n * 9 < sum)
    printf("-1 -1\n");
  else {
    int s = sum;
    int pos = 1;
    while (sum) {
      if (sum >= 9) {
        b[pos] = 9;
        sum -= 9;
      } else {
        b[pos] = sum;
        sum = 0;
      }
      pos++;
    }
    sum = s;
    pos = n;
    sum--;
    a[1] = 1;
    while (sum) {
      if (pos == 1) {
        a[pos] += sum;
        sum = 0;
      } else {
        if (sum >= 9) {
          a[pos] = 9;
          sum -= 9;
        } else {
          a[pos] = sum;
          sum = 0;
        }
      }
      pos--;
    }
    for (int i = 1; i <= n; ++i) printf("%d", a[i]);
    printf(" ");
    for (int i = 1; i <= n; ++i) printf("%d", b[i]);
    printf("\n");
  }
}

### 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;
const int maxn = 200010;
int n, sum;
int a[maxn], b[maxn];
int main() {
  scanf("%d%d", &n, &sum);
  if (sum == 0) {
    if (n == 1)
      printf("0 0\n");
    else
      printf("-1 -1\n");
    return 0;
  }
  if (n * 9 < sum)
    printf("-1 -1\n");
  else {
    int s = sum;
    int pos = 1;
    while (sum) {
      if (sum >= 9) {
        b[pos] = 9;
        sum -= 9;
      } else {
        b[pos] = sum;
        sum = 0;
      }
      pos++;
    }
    sum = s;
    pos = n;
    sum--;
    a[1] = 1;
    while (sum) {
      if (pos == 1) {
        a[pos] += sum;
        sum = 0;
      } else {
        if (sum >= 9) {
          a[pos] = 9;
          sum -= 9;
        } else {
          a[pos] = sum;
          sum = 0;
        }
      }
      pos--;
    }
    for (int i = 1; i <= n; ++i) printf("%d", a[i]);
    printf(" ");
    for (int i = 1; i <= n; ++i) printf("%d", b[i]);
    printf("\n");
  }
}

```