Phone numbers

In the present world you frequently meet a lot of call numbers and
they are going to be longer and longer. You need to remember such a
kind of numbers. One method how to do it in an easy way is to assign
letters to digits as shown in the following picture:

1 ij 2 abc 3 def
4 gh 5 kl 6 mn
7 prs 8 tuv 9 wxy
0 oqz

This way every word or a group of words can be assigned a unique
number, so you can remember words instead of call numbers. It is
evident that it has its own charm if it is possible to find some
simple relationship between the word and the person itself. So you can
learn that the call number 941837296 of a chess playing friend of
yours can be read as WHITEPAWN, and the call number 2855304 of your

Write a program to find the shortest sequence of words (i.e. one
having the smallest possible number of words) which corresponds to a
given number and a given list of words. The correspondence is
described by the picture above.

Input:

The first line of input file PHONE.IN contains the call number, the
transcription of which you have to find. The number consists of at
most 100 digits. The second line contains the total number of the
words in the dictionary (maximum is 50000). Each of the remaining
lines contains one word, which consists of maximally 50 small letters
of the English alphabet. The total size of the input file doesn't
exceed 300KB.

Output:

The only line of output file PHONE.OUT contains the shortest sequence
of words which has been found by your program. The words are separated
by single spaces. If there is no solution to the input data, the line
contains text `No solution.'. If there are more solutions having the
minimum number of words, you can choose any single one of them.

Example:

There is only one solution to the input file PHONE.IN containing
7325189087
5
it
your
reality
real
our

written in the output file PHONE.OUT, which is
reality our
(next possibility `real it your' corresponding to the same
number is longer).

If the number is `4294967296',
the only correct result is:
No solution.
because no given word contains letters g
and h which are necessary to obtain the digit 4.