#include <bits/stdc++.h>
int main() {
  int a[105];
  int sum, i;
  int n, summ;
  while (scanf("%d%d", &n, &summ) != EOF) {
    sum = 0;
    for (i = 1; i <= n; i++) {
      a[i] = 9;
      sum += 9;
    }
    if (n == 1 && summ == 0) {
      printf("0 0\n");
      continue;
    }
    if (summ == 0 || summ > 9 * n) {
      printf("-1 -1\n");
      continue;
    }
    i = 1;
    while (sum > summ) {
      if (i == 1) {
        if (a[i] > 1) {
          a[i]--;
          sum--;
        } else
          i++;
      } else {
        if (a[i] > 0) {
          a[i]--;
          sum--;
        } else
          i++;
      }
    }
    for (i = 1; i <= n; i++) {
      printf("%d", a[i]);
    }
    printf(" ");
    sum = 0;
    for (i = 1; i <= n; i++) {
      a[i] = 9;
      sum += 9;
    }
    i = n;
    while (sum > summ) {
      if (a[i] > 0) {
        a[i]--;
        sum--;
      } else
        i--;
    }
    for (i = 1; i <= n; i++) {
      printf("%d", a[i]);
    }
    printf("\n");
  }
  return 0;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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>
int main() {
  int a[105];
  int sum, i;
  int n, summ;
  while (scanf("%d%d", &n, &summ) != EOF) {
    sum = 0;
    for (i = 1; i <= n; i++) {
      a[i] = 9;
      sum += 9;
    }
    if (n == 1 && summ == 0) {
      printf("0 0\n");
      continue;
    }
    if (summ == 0 || summ > 9 * n) {
      printf("-1 -1\n");
      continue;
    }
    i = 1;
    while (sum > summ) {
      if (i == 1) {
        if (a[i] > 1) {
          a[i]--;
          sum--;
        } else
          i++;
      } else {
        if (a[i] > 0) {
          a[i]--;
          sum--;
        } else
          i++;
      }
    }
    for (i = 1; i <= n; i++) {
      printf("%d", a[i]);
    }
    printf(" ");
    sum = 0;
    for (i = 1; i <= n; i++) {
      a[i] = 9;
      sum += 9;
    }
    i = n;
    while (sum > summ) {
      if (a[i] > 0) {
        a[i]--;
        sum--;
      } else
        i--;
    }
    for (i = 1; i <= n; i++) {
      printf("%d", a[i]);
    }
    printf("\n");
  }
  return 0;
}

```