Problem: 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 ≤ 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

Solution (in JAVA):

Solution:
import java.util.*;
public class ChangingAString {
	
	static int[][] ed = null;
	static String a = null;
	static String b = null;

	// Levenshtein Distance
	static void findEditDistance(int m, int n) {
		for (int i=1; i<m; i++) {
			for (int j=1; j<n; j++) {
				ed[i][j]=Math.min(ed[i-1][j-1]+((a.charAt(i)==b.charAt(j)) ? 0 : 1),
					Math.min(ed[i-1][j]+1,ed[i][j-1]+1));
			}
		}
	}

	// Replacing the backtracking logic with a simpler version
	static void backTrack(int i, int j) {
		if (i==0 && j==0) return;
		if(j>0 && ed[i][j]==ed[i][j-1]+1) {
			backTrack(i,j-1);
			System.out.println("INSERT "+j+" "+b.charAt(j));
		} else if (i>0 && ed[i][j]==ed[i-1][j]+1) {
			backTrack(i-1,j);
			System.out.println("DELETE "+(j+1));
		} else {
			backTrack(i-1,j-1);
			if (a.charAt(i)!=b.charAt(j)) {
				System.out.println("REPLACE "+j+" "+b.charAt(j));
			}
		}
	}

	static void solve() {
		Scanner sc = new Scanner(System.in);
		a = "#"+sc.next(); b = "#"+sc.next();
		int m = a.length(), n = b.length(), i = 1, j = 1;
		ed = new int[m][n];
		boolean del = false;
		String s = null;
		while (i<m) { ed[i][0]=i++; }
		while (j<n) { ed[0][j]=j++; }
		findEditDistance(m,n);
		System.out.println(ed[m-1][n-1]);
		backTrack(m-1,n-1);
		sc.close();
	}

	public static void main(String args[]) {
		solve();
	}

}