#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483640;
const int MAXN = 1111;
int N, M, t, k, q, x, y, val, num;
int op, m, n;
int Max, Min;
int vis[MAXN];
int X[MAXN], Y[MAXN];
int a[13][100005];
struct node {
  int x, y, op;
  node(int _op = 0, int _x = 0, int _y = 0) : op(_op), x(_x), y(_y) {}
};
node no[100005];
int main() {
  int cas = 0;
  int x, y, t;
  while (~scanf("%d%d", &n, &m)) {
    for (int i = 1; i <= 200; i++) printf("18");
    printf("\n");
    for (int i = 1; i < 200; i++) printf("81");
    printf("82\n");
  }
}
