Concatenations (2)

Write a program that, given a word $w$ and a sequence of words $s_1, \dots, s_n$ , prints all the ways to obtain $w$ by concatenating all the given words exactly once.

Input

Input consists of a word $w$ , followed by a natural number $n > 0$ , followed by $s_1, \dots, s_n$ . The words only include lowercase letters.

Output

Print all the ways to obtain $w$ by concatenating all the given words exactly once. If there is no solution, print a hyphen. Follow the format of the samples.

Information about the checker

You can print the solutions to this exercise in any order.

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-25T11:14:44.748Z