---

from itertools import *

# 1
s1 = input()
s2 = input()
res = sorted([f"{a}{b}" for a,b in product(s1, s2)])
print(*res)

# 2
s = input()
k = int(input())
print(len(list(permutations(s, k))))

# 3
n, k = map(int, input().split())
print(len(list(combinations(range(n), k))))

# 4
n = int(input())
items = input().split()
k = int(input())
for i in product(items, repeat = k):
    print(i)

# 5
s = input()
print(len(set(permutations(s))))

# 6
b = int(input())
n = int(input())
dig = list(range(b))
count = 0
for i in permutations(dig, n):
    if i[0] != 0:
        count += 1
print(count)

# 7
a = input()
v = input()
n = int(input())
vo = set(v)
count = 0
for p in product(a, repeat = n):
    valid = 1
    for i in range(n-1):
        if p[i] in vo and p[i+1] in vo:
            valid = 0
            break
    if valid:
        count += 1
print(count)