import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
4
og yhg
7 5 7 5
3
abc cde
6 6 6
3
abcd e
7 9 13
4
og yhga
2 4 6 8
"""

def ExtGCD(a, b):
    if b:
        g, y, x = ExtGCD(b, a % b)
        y -= (a // b)*x
        return g, x, y
    return a, 1, 0

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N=int(input())
  S,T=input().split()
  A=list(map(int, input().split()))
  s,t=len(S),len(T)
  if s==t:
    for i in range(N):
      print(*([S]*(A[i]//s)))
  else:
    g,x,y=ExtGCD(s,t)
    p=s//g
    for i in range(N):
      n=A[i]*y//p
      a,b=A[i]//g*x+t//g*n,A[i]//g*y-s//g*n
      print(*([S]*a+[T]*b))

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)