Problem: Let s(x) be sum of digits in decimal representation of positive integer x. Given two integers n and m, find some positive integers a and b such that 

  * s(a) ≥ n, 
  * s(b) ≥ n, 
  * s(a + b) ≤ m. 

Input

The only line of input contain two integers n and m (1 ≤ n, m ≤ 1129).

Output

Print two lines, one for decimal representation of a and one for decimal representation of b. Both numbers must not contain leading zeros and must have length no more than 2230.

Examples

Input

6 5


Output

6 
7


Input

8 16


Output

35 
53

Note

In the first sample, we have n = 6 and m = 5. One valid solution is a = 6, b = 7. Indeed, we have s(a) = 6 ≥ n and s(b) = 7 ≥ n, and also s(a + b) = s(13) = 4 ≤ m.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct Bigint {
  string a;
  int sign;
  Bigint() {}
  Bigint(string b) { (*this) = b; }
  Bigint(long long num) {
    if (num < 0)
      sign = -1;
    else
      sign = 1;
    if (num == 0) a.push_back('0');
    while (num) {
      a.push_back(num % 10 + '0');
      num /= 10;
    }
  }
  int size() { return a.size(); }
  Bigint inverseSign() {
    sign *= -1;
    return (*this);
  }
  Bigint normalize(int newSign) {
    for (int i = a.size() - 1; i > 0 && a[i] == '0'; i--)
      a.erase(a.begin() + i);
    sign = (a.size() == 1 && a[0] == '0') ? 1 : newSign;
    return (*this);
  }
  void operator=(string b) {
    a = b[0] == '-' ? b.substr(1) : b;
    reverse(a.begin(), a.end());
    this->normalize(b[0] == '-' ? -1 : 1);
  }
  bool operator<(const Bigint &b) const {
    if (sign != b.sign) return sign < b.sign;
    if (a.size() != b.a.size())
      return sign == 1 ? a.size() < b.a.size() : a.size() > b.a.size();
    for (int i = a.size() - 1; i >= 0; i--)
      if (a[i] != b.a[i]) return sign == 1 ? a[i] < b.a[i] : a[i] > b.a[i];
    return false;
  }
  bool operator==(const Bigint &b) const { return a == b.a && sign == b.sign; }
  Bigint operator+(Bigint b) {
    if (sign != b.sign) return (*this) - b.inverseSign();
    Bigint c;
    for (int i = 0, carry = 0; i < a.size() || i < b.size() || carry; i++) {
      carry +=
          (i < a.size() ? a[i] - 48 : 0) + (i < b.a.size() ? b.a[i] - 48 : 0);
      c.a += (carry % 10 + 48);
      carry /= 10;
    }
    return c.normalize(sign);
  }
  Bigint operator-(Bigint b) {
    if (sign != b.sign) return (*this) + b.inverseSign();
    int s = sign;
    sign = b.sign = 1;
    if ((*this) < b) return ((b - (*this)).inverseSign()).normalize(-s);
    Bigint c;
    for (int i = 0, borrow = 0; i < a.size(); i++) {
      borrow = a[i] - borrow - (i < b.size() ? b.a[i] : 48);
      c.a += borrow >= 0 ? borrow + 48 : borrow + 58;
      borrow = borrow >= 0 ? 0 : 1;
    }
    return c.normalize(s);
  }
  Bigint operator*(Bigint b) {
    int MAXN = a.size() + b.size() + 5;
    int tmp[MAXN];
    memset(tmp, 0, sizeof(tmp));
    for (int i = 0; i < a.size(); i++)
      for (int j = 0, p = i; j < b.size(); j++) {
        tmp[p++] += (a[i] - '0') * (b.a[j] - '0');
      }
    Bigint c;
    for (int i = 0; i < MAXN - 1; i++) {
      tmp[i + 1] += tmp[i] / 10;
      tmp[i] %= 10;
      c.a.push_back(tmp[i] + '0');
    }
    return c.normalize(sign * b.sign);
  }
  Bigint operator/(Bigint b) {
    if (b.size() == 1 && b.a[0] == '0') b.a[0] /= (b.a[0] - 48);
    Bigint c("0"), d;
    for (int j = 0; j < a.size(); j++) d.a += "0";
    int dSign = sign * b.sign;
    b.sign = 1;
    for (int i = a.size() - 1; i >= 0; i--) {
      c.a.insert(c.a.begin(), '0');
      c = c + a.substr(i, 1);
      while (!(c < b)) c = c - b, d.a[i]++;
    }
    return d.normalize(dSign);
  }
  Bigint operator%(Bigint b) {
    if (b.size() == 1 && b.a[0] == '0') b.a[0] /= (b.a[0] - 48);
    Bigint c("0");
    b.sign = 1;
    for (int i = a.size() - 1; i >= 0; i--) {
      c.a.insert(c.a.begin(), '0');
      c = c + a.substr(i, 1);
      while (!(c < b)) c = c - b;
    }
    return c.normalize(sign);
  }
  void print() {
    if (sign == -1) putchar('-');
    reverse(a.begin(), a.end());
    cout << a << "\n";
    reverse(a.begin(), a.end());
  }
};
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  string sum = "";
  int szS = 0;
  for (int i = 0; i < m; i++) sum = sum + "1", szS++;
  string frs = "";
  int szF = 0;
  for (int i = 0; i < n; i++) frs = frs + "1", szF++;
  int lft = 0;
  if (szF + 1 > szS) lft = lft + (szF + 1 - szS);
  for (int i = 0; i < lft; i++) sum = sum + "0", szS++;
  cout << frs << "\n";
  Bigint A(sum);
  Bigint B(frs);
  Bigint res = A - B;
  res.print();
}