Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Changing a String

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThere 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 ≤*pos*≤ |*s*| + 1,*A*≤*ch*≤*Z*). The letter*ch*becomes the*pos*-th symbol of the string*s*, at that the letters shift aside and the length of the string increases by 1. - DELETE
*pos*— delete a character number*pos*(1 ≤*pos*≤ |*s*|) from the string*s*. At that the letters shift together and the length of the string decreases by 1. - REPLACE
*pos**ch*— the letter in the position*pos*of the line*s*is replaced by*ch*(1 ≤*pos*≤ |*s*|,*A*≤*ch*≤*Z*). At that the length of the string does not change.

Your task is to find in which minimal number of moves one can get a *t* string from an *s* string. You should also find the sequence of actions leading to the required results.

Input

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.

Output

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.

Examples

Input

ABA

ABBBA

Output

2

INSERT 3 B

INSERT 4 B

Input

ACCEPTED

WRONGANSWER

Output

10

REPLACE 1 W

REPLACE 2 R

REPLACE 3 O

REPLACE 4 N

REPLACE 5 G

REPLACE 6 A

INSERT 7 N

INSERT 8 S

INSERT 9 W

REPLACE 11 R

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/25/2017 09:45:26 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|