#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
void pmin(int m, int s) {
  if (s == 0) {
    if (m == 1)
      cout << "0";
    else
      cout << "-1";
    return;
  }
  if (s > 9 * m) {
    cout << "-1";
    return;
  }
  vector<long long int> minnum(m);
  int num9 = s / 9;
  s %= 9;
  if (num9 < m) {
    if (s != 0) {
      minnum[m - 1] = 1;
      s -= 1;
    } else {
      num9--;
      minnum[m - 1] = 1;
      s = 8;
    }
  }
  int i = 0;
  for (i = 0; i < num9; i++) minnum[i] = 9;
  if (i < m - 1)
    minnum[i] = s;
  else if (i == m - 1)
    minnum[i] = s + 1;
  for (int j = m - 1; j >= 0; j--) cout << minnum[j];
  return;
}
void pmax(int m, int s) {
  if (s == 0) {
    if (m == 1)
      cout << "0";
    else
      cout << "-1";
    return;
  }
  if (s > 9 * m) {
    cout << "-1";
    return;
  }
  for (int i = 0; i < m; i++) {
    if (s > 9) {
      cout << "9";
      s -= 9;
    } else if (s > 0) {
      cout << s;
      s = 0;
    } else
      cout << "0";
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int m, s;
  cin >> m >> s;
  pmin(m, s);
  cout << " ";
  pmax(m, s);
  cout << endl;
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
void pmin(int m, int s) {
  if (s == 0) {
    if (m == 1)
      cout << "0";
    else
      cout << "-1";
    return;
  }
  if (s > 9 * m) {
    cout << "-1";
    return;
  }
  vector<long long int> minnum(m);
  int num9 = s / 9;
  s %= 9;
  if (num9 < m) {
    if (s != 0) {
      minnum[m - 1] = 1;
      s -= 1;
    } else {
      num9--;
      minnum[m - 1] = 1;
      s = 8;
    }
  }
  int i = 0;
  for (i = 0; i < num9; i++) minnum[i] = 9;
  if (i < m - 1)
    minnum[i] = s;
  else if (i == m - 1)
    minnum[i] = s + 1;
  for (int j = m - 1; j >= 0; j--) cout << minnum[j];
  return;
}
void pmax(int m, int s) {
  if (s == 0) {
    if (m == 1)
      cout << "0";
    else
      cout << "-1";
    return;
  }
  if (s > 9 * m) {
    cout << "-1";
    return;
  }
  for (int i = 0; i < m; i++) {
    if (s > 9) {
      cout << "9";
      s -= 9;
    } else if (s > 0) {
      cout << s;
      s = 0;
    } else
      cout << "0";
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int m, s;
  cin >> m >> s;
  pmin(m, s);
  cout << " ";
  pmax(m, s);
  cout << endl;
  return 0;
}

```