Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	n := io.NextInt()
	for i := 0; i < n; i++ {
		s, t := io.NextLine(), io.NextLine()
		io.Println(f(s, t))
	}
}

func f(s, t string) string {
	for i := len(s) - 1; i >= 0; i-- {
		switch s[i] {
		case 'C':
			t = strings.Join([]string{t[1:], string(t[0])}, "")
		case 'J':
			t = strings.Join([]string{string(t[len(t)-1]), t[:len(t)-1]}, "")
		case 'E':
			if len(t)%2 == 1 {
				t = strings.Join([]string{t[len(t)/2+1:], string(t[len(t)/2]), t[:len(t)/2]}, "")
			} else {
				t = strings.Join([]string{t[len(t)/2:], t[:len(t)/2]}, "")
			}
		case 'A':
			r := []rune(t)
			for i, n := 0, len(r); i < n/2; i++ {
				r[i], r[n-i-1] = r[n-i-1], r[i]
			}
			t = string(r)
		case 'M':
			r := []rune(t)
			for i := 0; i < len(r); i++ {
				if '0' <= r[i] && r[i] < '9' {
					r[i]++
				} else if r[i] == '9' {
					r[i] = '0'
				}
			}
			t = string(r)
		case 'P':
			r := []rune(t)
			for i := 0; i < len(r); i++ {
				if '0' < r[i] && r[i] <= '9' {
					r[i]--
				} else if r[i] == '0' {
					r[i] = '9'
				}
			}
			t = string(r)
		}
	}
	return t
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := make([]interface{}, 0, len(a))
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := make([]interface{}, 0, len(a))
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

string cmd_J(string s){
  string ret;
  for(int i = 1 ; i < (int)(s.size()) ; i++){
    ret += s[i];
  }
  ret += s[0];
  return ret;
}

string cmd_C(string s){
  string ret;
  ret += s[s.size()-1];
  for(int i = 0 ; i < (int)(s.size()-1) ; i++){
    ret += s[i];
  }
  return ret;
}

string cmd_E(string s){
  string a, b;
  
  if(s.size()%2 == 1){
    a = s.substr(0, s.size()/2);
    b = s.substr(s.size()/2+1, s.size());
    return b+s[s.size()/2]+a;
  }
  else{
    a = s.substr(0, s.size()/2);
    b = s.substr(s.size()/2, s.size());
    return b+a;
  }  
}

string cmd_A(string s){
  string ret = s;
  reverse(ret.begin(), ret.end());
  return ret;
}

string cmd_P(string s){
  for(int i = 0 ; i < (int)(s.size()) ; i++){
    if(isdigit(s[i])){
      int a = s[i]-'0';
      a++;
      if(a == 10) a = 0;
      s[i] = a+'0';
    }
  }
  return s;
}

string cmd_M(string s){
  for(int i = 0 ; i < (int)(s.size()) ; i++){
    if(isdigit(s[i])){
      int a = s[i]-'0';
      a--;
      if(a == -1) a = 9;
      s[i] = a+'0';
    }
  }
  return s;
}

int main(){
  int n;
  cin >> n;
  while(n--){
    string cmd, message;
    cin >> cmd >> message;
    for(int i = (int)(cmd.size()-1) ; i >= 0 ; i--){
      switch(cmd[i]){
      case 'J': 
	message = cmd_C(message);
	break;
      case 'C':
	message = cmd_J(message);
	break;
      case 'E': 
	message = cmd_E(message);
	break;
      case 'A':
	message = cmd_A(message);
	break;
      case 'P': 
	message = cmd_M(message);
	break;
      case 'M':
	message = cmd_P(message);
	break;
      }
    }
    cout << message << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string.h>
#include <cstdio>
#include <map>
#include <queue>
#define INF 10000000

using namespace std;

int main(){
  int n;
  string str,odr;
  cin >> n;
  while(n--){
    cin >> odr;
    cin >> str;
    int size = str.size();
    string tmp = "";
    for(int i = odr.size()-1 ; i >= 0 ; i-- ){
      switch(odr[i]){
      case 'A':
	reverse(str.begin(),str.end());
	break;
      case 'C':
	tmp = "";
	for(int i = 1 ; i < size ; i++ ){
	  tmp += str[i];
	}
	str = tmp+str[0];
	break;
      case 'J':
	tmp = "";
	for(int i = 0 ; i < size-1 ; i++ ){
	  tmp += str[i];
	}
	str = str[size-1] + tmp;
	break;
      case 'M':
	for(int i = 0 ; i < size ; i++ ){
	  if('0' <= str[i] && str[i] <= '9'){
	    str[i] = char(str[i]+1);
	  }
	}
	break;
      case 'P':
	for(int i = 0 ; i < size ; i++ ){
	  if('0' <= str[i] && str[i] <= '9'){
	    str[i] = char(str[i]-1);
	  }
	}
	break;
      case 'E':
	if(size%2==1){
	  str = str.substr((size/2)+1,size - size/2)+ str[size/2] + str.substr(0,(size/2)); 
	}else {
	  str = str.substr((size/2),size - size/2) + str.substr(0,(size/2));
	}
	break;
      }
    }
    cout << str << endl;
  }
  return 0;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;

//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt"
int main() {
	int N; cin >> N;
	while (N--) {
		string st; cin >> st;
		string aa; cin >> aa;
		for (int i = 0; i < st.size(); ++i) {
			char c = st[st.size() - 1 - i];
			if (c == 'A') {
				reverse(aa.begin(), aa.end());
			}
			else if (c == 'C') {
				rotate(aa.begin(), aa.begin() + 1, aa.end());
			}
			else if (c == 'M') {
				for (auto& ac : aa) {
					if (isdigit(ac))ac = (ac - '0' + 1) % 10 + '0';
				}
			}
			else if (c == 'P') {
				for (auto& ac : aa) {
					if (isdigit(ac))ac = (ac - '0' + 9) % 10 + '0';
				}
			}
			else if (c == 'E') {
				string from = aa.substr(0,aa.size() / 2);
				string to = aa.substr(aa.size()-aa.size() / 2,aa.size() / 2);
				if (aa.size() % 2)aa = to + aa[st.size() / 2] + from;
				else aa = to + from;
			}
			else if (c == 'J') {

				rotate(aa.begin(), aa.begin() + aa.size()-1, aa.end());
			}
		}
		cout << aa << endl;
	}
	return 0;
}