Edit Path

Modify the solution to the Edit Distance Problem that was developed in lecture on May 26th to show a minimum series of one step transformations to change the first word into the second word.

Note: if more than one minimum sequence exists, you may print any valid sequence.

Sample Input: path.in


Sample Output: path.out

Transformation of whaleshark to whaleshark in 0 steps:

0. whaleshark
Transformation of kyoto to tokyo in 4 steps:

0. kyoto
1. tyoto
2. tooto
3. tokto
4. tokyo