#include <bits/stdc++.h>
using namespace std;
int sm[101];
int lg[101];
void checks(int m, int sum) {
  if (sum == 0) {
    if (m == 1) {
      printf("0");
      return;
    } else {
      printf("-1");
      return;
    }
  }
  if (sum > 9 * m) {
    printf("-1");
    return;
  } else {
    sum -= 1;
    for (int i = m - 1; i > 0; i--) {
      if (sum > 9) {
        sm[i] = 9;
        sum -= 9;
      } else {
        sm[i] = sum;
        sum = 0;
      }
    }
    sm[0] = sum + 1;
    for (int i = 0; i < m; i++) {
      printf("%d", sm[i]);
    }
    return;
  }
}
void checkl(int m, int sum) {
  if (sum == 0) {
    if (m == 1) {
      printf("0");
      return;
    } else {
      printf("-1");
      return;
    }
  }
  if (sum > 9 * m) {
    printf("-1");
    return;
  } else {
    for (int i = 0; i < m; i++) {
      if (sum >= 9) {
        lg[i] = 9;
        sum -= 9;
      } else {
        lg[i] = sum;
        sum = 0;
      }
    }
    for (int i = 0; i < m; i++) {
      printf("%d", lg[i]);
    }
    return;
  }
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < 101; i++) {
    sm[i] = -1;
    lg[i] = -1;
  }
  checks(n, m);
  printf(" ");
  checkl(n, m);
  return 0;
}

### Prompt

In CPP, your task is to solve 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 sm[101];
int lg[101];
void checks(int m, int sum) {
  if (sum == 0) {
    if (m == 1) {
      printf("0");
      return;
    } else {
      printf("-1");
      return;
    }
  }
  if (sum > 9 * m) {
    printf("-1");
    return;
  } else {
    sum -= 1;
    for (int i = m - 1; i > 0; i--) {
      if (sum > 9) {
        sm[i] = 9;
        sum -= 9;
      } else {
        sm[i] = sum;
        sum = 0;
      }
    }
    sm[0] = sum + 1;
    for (int i = 0; i < m; i++) {
      printf("%d", sm[i]);
    }
    return;
  }
}
void checkl(int m, int sum) {
  if (sum == 0) {
    if (m == 1) {
      printf("0");
      return;
    } else {
      printf("-1");
      return;
    }
  }
  if (sum > 9 * m) {
    printf("-1");
    return;
  } else {
    for (int i = 0; i < m; i++) {
      if (sum >= 9) {
        lg[i] = 9;
        sum -= 9;
      } else {
        lg[i] = sum;
        sum = 0;
      }
    }
    for (int i = 0; i < m; i++) {
      printf("%d", lg[i]);
    }
    return;
  }
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < 101; i++) {
    sm[i] = -1;
    lg[i] = -1;
  }
  checks(n, m);
  printf(" ");
  checkl(n, m);
  return 0;
}

```