Akki and Akku fond of playing with numbers. One day, before Ultimate Coding Showdown Prelims, Akki got tickets to the onsite round of the contest. Hearing this, Akku got really excited and she desired of getting the ticket too. Since Akki was fond of numbers, he gave Akku a challenge. He gave her a number Num1, and asked it to convert it to another number Num2 by only following changes : changing a digit, deleting a digit, inserting a digit. But Akki is very sensitive about efficiency. He wants Akku to do it in minimum number of changes, and also wants Akku to tell all ways in which it can be done. Now Akku is yearning for getting the ticket. Can you help Akku in figuring out what all ways are possible?

Example 1

Num1 : 123456
Num2 : 1934648

One way of getting Num2 from Num1 is:
Add 8
Replace 6 with 4
Replace 5 with 6
Replace 2 with 9

Example 2

Num1 : 146
Num2 : 367

different ways of doing it are
Add 7
Remove 4
Replace 1 with 3

Add 7
Replace 4 with 3
Remove 1

Replace 6 with 7
Replace 4 with 6
Replace 1 with 3

Your task is to find out the solutions in exactly the same way as Akki has asked, else Akku will miss out on getting the tickets? Can you help Akku in getting her ticket?

INPUT

Each Test Case Consists of two numbers, Num1 and Num2 each in one line.

0 < |Num1|, |Num2| < 100

OUTPUT

Output the different ways to print the solution, with each operation in a new line. Different methods should be separated with a single newline.