Problem:
Problem A: Unreliable Messengers

The King of a little Kingdom on a little island in the Pacific Ocean frequently has childish
ideas. One day he said, “You shall make use of a message relaying game when you inform me
of something.” In response to the King’s statement, six servants were selected as messengers
whose names were Mr. J, Miss C, Mr. E, Mr. A, Dr. P, and Mr. M. They had to relay a message
to the next messenger until the message got to the King.

Messages addressed to the King consist of digits (‘0’-‘9’) and alphabet characters (‘a’-‘z’, ‘A’-‘Z’). Capital and small letters are distinguished in messages. For example, “ke3E9Aa” is a
message.

Contrary to King’s expectations, he always received wrong messages, because each messenger
changed messages a bit before passing them to the next messenger. Since it irritated the King, he
told you who are the Minister of the Science and Technology Agency of the Kingdom, “We don’t
want such a wrong message any more. You shall develop software to correct it!” In response to
the King’s new statement, you analyzed the messengers’ mistakes with all technologies in the
Kingdom, and acquired the following features of mistakes of each messenger. A surprising point
was that each messenger made the same mistake whenever relaying a message. The following
facts were observed.

Mr. J rotates all characters of the message to the left by one. For example, he transforms
“aB23d” to “B23da”.

Miss C rotates all characters of the message to the right by one. For example, she transforms
“aB23d” to “daB23”.

Mr. E swaps the left half of the message with the right half. If the message has an odd number
of characters, the middle one does not move. For example, he transforms “e3ac” to “ace3”,
and “aB23d” to “3d2aB”.

Mr. A reverses the message. For example, he transforms “aB23d” to “d32Ba”.

Dr. P increments by one all the digits in the message. If a digit is ‘9’, it becomes ‘0’. The
alphabet characters do not change. For example, he transforms “aB23d” to “aB34d”, and “e9ac”
to “e0ac”.

Mr. M decrements by one all the digits in the message. If a digit is ‘0’, it becomes ‘9’. The
alphabet characters do not change. For example, he transforms “aB23d” to “aB12d”, and “e0ac”
to “e9ac”.

The software you must develop is to infer the original message from the final message, given the
order of the messengers. For example, if the order of the messengers is A -> J -> M -> P and the
message given to the King is “aB23d”, what is the original message? According to the features
of the messengers’ mistakes, the sequence leading to the final message is

A J M P
“32Bad” --> “daB23” --> “aB23d” --> “aB12d” --> “aB23d”.

As a result, the original message should be “32Bad”.

Input

The input format is as follows.

n
The order of messengers
The message given to the King
.
.
.
The order of messengers
The message given to the King

The first line of the input contains a positive integer n, which denotes the number of data sets.
Each data set is a pair of the order of messengers and the message given to the King. The
number of messengers relaying a message is between 1 and 6 inclusive. The same person may
not appear more than once in the order of messengers. The length of a message is between 1
and 25 inclusive.

Output

The inferred messages are printed each on a separate line.

Sample Input

5
AJMP
aB23d
E
86AE
AM
6
JPEM
WaEaETC302Q
CP
rTurnAGundam1isdefferentf

Output for the Sample Input

32Bad
AE86
7
EC302QTWaEa
TurnAGundam0isdefferentfr

Solution in Scala (judge verdict: Accepted)

import java.util.Scanner
import scala.collection.Searching._

import scala.annotation.tailrec

class IUnionFind(val size: Int) {

  private case class Node(var parent: Option[Int], var treeSize: Int)

  private val nodes = Array.fill[Node](size)(new Node(None, 1))

  def union(t1: Int, t2: Int): IUnionFind = {
    if (t1 == t2) return this

    val root1 = root(t1)
    val root2 = root(t2)
    if (root1 == root2) return this

    val node1 = nodes(root1)
    val node2 = nodes(root2)

    if (node1.treeSize < node2.treeSize) {
      node1.parent = Some(t2)
      node2.treeSize += node1.treeSize
    } else {
      node2.parent = Some(t1)
      node1.treeSize += node2.treeSize
    }
    this
  }

  def connected(t1: Int, t2: Int): Boolean = t1 == t2 || root(t1) == root(t2)

  @tailrec
  private def root(t: Int): Int = nodes(t).parent match {
    case None => t
    case Some(p) => root(p)
  }
}


object Main {
  def replace1(input: String): String = {
    if (input == "") ("") else {
      (input(0) match {
        case '0' => "1"
        case '1' => "2"
        case '2' => "3"
        case '3' => "4"
        case '4' => "5"
        case '5' => "6"
        case '6' => "7"
        case '7' => "8"
        case '8' => "9"
        case '9' => "0"
        case x => x
      }) + replace1(input.substring(1))
    }
  }

  def replace2(input: String): String = {
    if (input == "") ("") else {
      (input(0) match {
        case '0' => "9"
        case '1' => "0"
        case '2' => "1"
        case '3' => "2"
        case '4' => "3"
        case '5' => "4"
        case '6' => "5"
        case '7' => "6"
        case '8' => "7"
        case '9' => "8"
        case x => x
      }) + replace2(input.substring(1))
    }
  }

  def solve2(order: String, message: String): String = {
    if (order == "") (message) else {
      solve2(order.substring(1),
        order(0) match {
          case 'J' => message.charAt(message.length - 1) + message.substring(0, message.length - 1)
          case 'C' => message.substring(1) + message.charAt(0)
          case 'E' => message.substring((message.length + 1) / 2) + (if (message.length % 2 == 0) ("") else (message(message.length / 2))) + message.substring(0, message.length / 2)
          case 'A' => message.reverse
          case 'P' => replace2(message)
          case 'M' => replace1(message)
        })
    }
  }

  def solve(sc: => Scanner): Unit = {
    val N = sc.nextInt
    for (_ <- 0 until N) {
      println(solve2(sc.next.reverse, sc.next))
    }
  }

  def main(args: Array[String]): Unit = {
    val sc: Scanner = new Scanner(System.in)

    solve(sc)
  }
}