Given a string, an operation consists of either adding, changing, or removing one letter. The string must change.
Given an alphabet and an original string, compute all strings which are attainable from that string using one operation.
~1 \le |S| \le 100~
The first line contains a string of lowercase letters, the alphabet of letters to use.
The second line contains the original string ~S~.
Output all such strings in sorted order.
eeg eegg eg ege egeg egge eggg gegg gg ggg