Problem:
Problem C: Emacs-like Editor

Emacs is a text editor which is widely used by many programmers.

The advantage of Emacs is that we can move a cursor without arrow keys and the mice. For example, the cursor can be moved right, left, down, and up by pushing f, b, n, p with the Control Key respectively. In addition, cut-and-paste can be performed without the mouse.

Your task is to write a program which simulates key operations in the Emacs-like editor. The program should read a text and print the corresponding edited text.

The text consists of several lines and each line consists of zero or more alphabets and space characters. A line, which does not have any character, is a blank line.

The editor has a cursor which can point out a character or the end-of-line in the corresponding line. The cursor can also point out the end-of-line in a blank line.

In addition, the editor has a buffer which can hold either a string (a sequence of characters) or a linefeed.

The editor accepts the following set of commands (If the corresponding line is a blank line, the word "the first character" should be "the end-of-line"):

a

Move the cursor to the first character of the current line.

e

Move the cursor to the end-of-line of the current line.

p

Move the cursor to the first character of the next upper line, if it exists.

If there is no line above the current line, move the cursor to the first character of the current line.

n

Move the cursor to the first character of the next lower line, if it exists.

If there is no line below the current line, move the cursor to the first character of the current line.

f

Move the cursor by one character to the right, unless the cursor points out the end-of-line.

If the cursor points out the end-of-line and there is a line below the current line, move the cursor to the first character of the next lower line. Otherwise, do nothing.

b

Move the cursor by one character to the left, unless the cursor points out the first character.

If the cursor points out the first character and there is a line above the current line, move the cursor to the end-of-line of the next upper line. Otherwise, do nothing.

d

If the cursor points out a character, delete the character (Characters and end-of-line next to the deleted character are shifted to the left).

If the cursor points out the end-of-line and there is a line below, the next lower line is appended to the end-of-line of the current line (Lines below the current line are shifted to the upper).
Otherwise, do nothing.

k

If the cursor points out the end-of-line and there is a line below the current line, perform the command d mentioned above, and record a linefeed on the buffer.

If the cursor does not point out the end-of-line, cut characters between the cursor (inclusive) and the end-of-line, and record them on the buffer. After this operation, the cursor indicates the end-of-line of the current line.

y

If the buffer is empty, do nothing.

If the buffer is holding a linefeed, insert the linefeed at the cursor. The cursor moves to the first character of the new line.

If the buffer is holding characters, insert the characters at the cursor. The cursor moves to the character or end-of-line which is originally pointed by the cursor.

The cursor position just after reading the text is the beginning of the first line, and the initial buffer is empty.

Input

The input consists of only one data-set which includes two parts. The first part gives a text consisting of several lines. The end of the text is indicated by a line (without quotes):

"END_OF_TEXT"

This line should not be included in the text.

Next part gives a series of commands. Each command is given in a line. The end of the commands is indicated by a character '-'.

Output

For the input text, print the text edited by the commands.

Constraints

The number of lines in the text given as input ≤ 10

The number of characters in a line given as input ≤ 20

The number of commands ≤ 300

The maximum possible number of lines in the text during operations ≤ 100

The maximum possible number of characters in a line during operations ≤ 1000

Sample Input

hyo
ni
END_OF_TEXT
f
d
f
f
k
p
p
e
y
a
k
y
y
n
y
-

Output for the Sample Input

honihoni
honi

Solution in JAVA (judge verdict: Time Limit Exceeded)

import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.Scanner;

import javax.xml.crypto.Data;
public class Main{

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		StringBuilder[] sb = new StringBuilder[101];
		for(int i = 0; i < sb.length; i++) {
			sb[i] = new StringBuilder();
		}
		int len = 0;
		while(true) {
			String in = sc.nextLine();
			if(in.equals("END_OF_TEXT")) break;
			sb[len++].append(in);
		}
		boolean LF = false;
		StringBuilder buffer = new StringBuilder();
		int ci = 0;
		int cj = 0;
		while(true) {
			String in = sc.nextLine();
			if(in.equals("-")) break;
			if(in.equals("a")) {
				cj = 0;
			}
			if(in.equals("e")) {
				cj = sb[ci].length();
			}
			if(in.equals("p")) {
				if(ci != 0) {
					ci--;
				}
				cj = 0;	
			}
			if(in.equals("n")) {
				if(ci+1 != len) {
					ci++;
				}
				cj = 0;
			}
			if(in.equals("f")) {
				if(cj != sb[ci].length()) {
					cj++;
				}
				else {
					if(ci+1 != len) {
						ci++;
						cj = 0;
					}
				}
			}
			if(in.equals("b")) {
				if(cj != 0) {
					cj--;
				}
				else {
					if(ci != 0) {
						ci--;
						cj = sb[ci].length();
					}
				}
			}
			if(in.equals("d")) {
				if(cj != sb[ci].length()) {
					sb[ci].deleteCharAt(cj);
				}
				else {
					if(ci+1 != len) {
						sb[ci].append(sb[ci+1]);
						ci++;
						while(ci+1 != len) {
							sb[ci] = sb[ci+1];
						}
						len--;
					}
				}
			}
			if(in.equals("k")) {
				if(cj == sb[ci].length()) {
					if(ci+1 != len) {
						sb[ci].append(sb[ci+1]);
						ci++;
						while(ci+1 != len) {
							sb[ci] = sb[ci+1];
						}
						len--;
					}
					buffer = new StringBuilder();
					LF = true;
				}
				else {
					buffer = new StringBuilder(sb[ci].substring(cj, sb[ci].length()));
					sb[ci].delete(cj, sb[ci].length());
					cj = sb[ci].length();
					LF = false;
				}
			}
			if(in.equals("y")) {
				if(LF) {
					int now = len;
					while(now != ci) {
						sb[now] = sb[now-1];
					}
					len++;
					sb[ci+1] = new StringBuilder(sb[ci].substring(cj,sb[ci].length()));
					sb[ci].delete(cj, sb[ci].length());
					ci++;
				}
				else {
					if(cj == sb[ci].length()) {
						sb[ci].insert(cj, buffer);
						cj = sb[ci].length();
					}
					else {
						sb[ci].insert(cj, buffer);
						cj += buffer.length();
					}
				}
			}
		}
		for(int i = 0; i < len; i++) {
			System.out.println(sb[i].toString());
		}
		
		
	}
}