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 "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1240>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

void C(string& str){
    str = str.substr(1) + *str.begin();
}
void J(string& str){
    str = *str.rbegin() + str.substr(0,str.length()-1);
}
void E(string& str){
    if(str.length()&1) str = str.substr(str.length()/2+1) + str[str.length()/2] + str.substr(0,str.length()/2);
    else str = str.substr(str.length()/2) + str.substr(0,str.length()/2);
}
void A(string& str){
    reverse(str.begin(),str.end());
}
void M(string& str){
    for(char& c:str){
        if(isdigit(c)){
            c = (c-'0'+1)%10 + '0';
        }
    }
}
void P(string& str){
    for(char& c:str){
        if(isdigit(c)){
            c = (c-'0'+9)%10 + '0';
        }
    }
}
map<char,int> char2idx;
void (*Func[])(string& str) = {J,C,E,A,P,M};
void init(){
    string FuncName = "JCEAPM";
    for(int i = 0; i < FuncName.length();i++) char2idx[FuncName[i]] = i;
}
string solve(){
    string order,res;
    cin >> order >> res;
    reverse(order.begin(),order.end());
    for(char& c:order){
        Func[char2idx[c]](res);
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    init();
    int n; cin >> n;
    while(n--){
        cout << solve() << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

using namespace std;
string revj(string a)
{
  string answer=a+a;
  return string(answer.begin()+a.size()-1,answer.end()-1);
}
string revc(string a)
{
  string answer=a+a;
  return string(answer.begin()+1,answer.begin()+a.size()+1);
}
string reve(string a)
{
  return string(a.end()-a.size()/2,a.end())+string(a.begin()+a.size()/2,a.end()-a.size()/2)+string(a.begin(),a.begin()+a.size()/2);
}
string reva(string a)
{
  return string(a.rbegin(),a.rend());
}
string revp(string a)
{
  string answer=a;
  REP(i,answer.size()) if(0<= answer[i]-'0' && answer[i]-'0' <= 9) answer[i]=(answer[i]-'0'+9)%10+'0';
  return answer;
}
string revm(string a)
{
  string answer=a;
  REP(i,answer.size()) if(0<= answer[i]-'0' && answer[i]-'0' <= 9) answer[i]=(answer[i]-'0'+1)%10+'0';
  return answer;
}
int main(void)
{
  int n;    
  cin >> n;
  REP(i,n){
    string cmd,tmp;
    cin >> cmd >> tmp;
    string rcmd(cmd.rbegin(),cmd.rend());
    for(auto i:rcmd){
      if(i=='J') tmp=revj(tmp);
      if(i=='C') tmp=revc(tmp);
      if(i=='E') tmp=reve(tmp);
      if(i=='A') tmp=reva(tmp);
      if(i=='P') tmp=revp(tmp);
      if(i=='M') tmp=revm(tmp);
    }
    cout << tmp << endl;
  }
  return 0;
}