from string import ascii_lowercase
import random


def f(b, mod):
    # S[i] * b^i
    d = {}
    for i in range(mod+1):
        x = pow(b, i, mod)
        if x in d:
            return i, d[x]

        d[x] = i

    assert False


def myhash(s: str, b, mod):
    h = 0
    for c in s:
        h = h*b + ord(c)
        h %= mod

    return h


A, B = map(int, input().split())

x, y = f(A, B)
n = max(x, y) + 1
s = random.choices(ascii_lowercase, k=n)
t = s[:]

p = n-1-x
q = n-1-y
t[p], t[q] = t[q], t[p]
assert myhash(s, A, B) == myhash(t, A, B)
print(''.join(s))
print(''.join(t))