{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}
{-# LANGUAGE FlexibleContexts #-}

{-# OPTIONS_GHC -O2 #-}
{-# OPTIONS_GHC -Wno-tabs #-}

import Control.Applicative
import Control.Arrow
import Control.Monad
import Control.Monad.ST

import Data.Char
import Data.List
import Data.Maybe

import qualified Data.ByteString.Char8 as B

import Data.Array
import Data.Array.ST.Safe
import Data.STRef

import Debug.Trace
import Text.Printf

readInt = readLn :: IO Int
readInteger = readLn :: IO Integer
readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine
readIntegers = map ( fst . fromJust . B.readInteger ) . B.words <$> B.getLine

which a b f = if f then a else b
yesno = which "Yes" "No"
mp [ a, b ] = ( a, b )

modifyArray a i f = writeArray a i =<< f <$> readArray a i

printList :: Show a => [a] -> IO ()
printList = putStrLn . intercalate " " . map show

main = do
	n <- readInt
	[ s, t ] <- words <$> getLine
	as <- readInts
	let
		ls = length s
		lt = length t
	mapM_ putStrLn $ do
		a <- as
		let
			numS = solve ls lt a
			numT = ( a - ls * numS ) `div` lt
		return $ intercalate " " ( replicate numS s ++ replicate numT t )

solve a b n = last $ do
	i <- takeWhile ( ( <= n ) . ( * a ) ) [ 0 .. n ]
	guard $ ( n - i * a ) `mod` b == 0
	return i