Programmers use version control systems to manage files in their projects, but in these systems, versions are saved only when you manually submit. Can you implement an IDE that automatically saves a new version whenever you insert or delete a string? Positions in the buffer are numbered from 1 from left to right. Initially, the buffer is empty and in version 0. Then you can execute 3 commands (vnow means the version before executing the command, and L[v] means the length of buffer at version v): • 1 p s: insert string s after position p (0 ≤ p ≤ L[vnow], p = 0 means insert before the start of the buffer). s contains at most 1 and at most 100 letters. • 2 p c: remove c characters starting at position p (p ≥ 1, p + c ≤ L[vnow] + 1). The remaining charactesr (if any) will be shifted left, filling the blank • 3 v p c: print c characters starting at position p (p ≥ 1,p+c ≤ L[v]+1), in version v (1 ≤ v ≤ vnow). The first command is guaranteed to be command 1(insert). After executing each command 1 or 2, version is incremented by 1. Input There is only one test case. It begins with a single integer n (1 ≤ n ≤ 50, 000), the number of commands. Each of the following n lines contains a command. The total length of all inserted string will not exceed 1,000,000. Output Print the results of command 3, in order. The total length of all printed strings will not exceed 200,000. Obfuscation: In order to prevent you from preprocessing the command, we adopt the following obfuscation scheme: • Each type-1 command becomes 1 p + d s • Each type-2 command becomes 2 p+d c+d • Each type-3 command becomes 3 v+d p+d c+d Where d is the number of lowercase letter ‘c’ you printed, before processing this command. Before the obfuscation, the sample input would be: 6 1 0 abcdefgh 243 3125 3223 1 2 xy 3324 This is the real input that your program must process when it reads the Sample Input below.
2/2 Sample Input 6 1 0 abcdefgh 243 3125 3334 1 4 xy 3546 Sample Output bcdef bcg bxyc