CF56D Changing a String

There is a string $ s $ , consisting of capital Latin letters. Let's denote its current length as $ |s| $ . During one move it is allowed to apply one of the following operations to it: - INSERT $ pos $ $ ch $ — insert a letter $ ch $ in the string $ s $ in the position $ pos $ ( $ 1

The first line contains $ s $ , the second line contains $ t $ . The lines consist only of capital Latin letters, their lengths are positive numbers from $ 1 $ to $ 1000 $ .

In the first line print the number of moves $ k $ in the given sequence of operations. The number should be the minimal possible one. Then print $ k $ lines containing one operation each. Print the operations in the format, described above. If there are several solutions, print any of them.