A doublet is a pair of words that differ in exactly one letter; for example, “booster" and “rooster" or “rooster" and “roaster" or “roaster" and “roasted".
You are given a dictionary of up to 25,143 lowercase words, not exceeding 16 letters each. You are then given a number of pairs of words. For each pair of words, find the shortest sequence of words that begins with the first word and ends with the second, such that each pair of adjacent words is a doublet. For example, if you were given the input pair “booster" and “roasted", a possible solution would be (“booster," “rooster," “roaster," “roasted"), provided that these words are all in the dictionary.
The input file contains the dictionary followed by a number of word pairs. The dictionary consists of a number of words, one per line, and is terminated by an empty line. The pairs of input words follow; each pair of words occurs on a line separated by a space.
For each input pair, print a set of lines starting with the first word and ending with the last. Each pair of adjacent lines must be a doublet.
If there are several minimal solutions, any one will do. If there is no solution, print a line: “No solution.'' Leave a blank line between cases.
booster rooster roaster coasted roasted coastal postal booster roasted coastal postal
booster rooster roaster roasted No solution