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 <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>

#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x);
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))

const int INF = 1000000000;
const double EPS = 1e-8;
const double PI = 3.14159;
int dx[4]={0, 1, 0, -1}, dy[4]={-1, 0, 1, 0};
using namespace std;
//typedef pair<int, int> P;
struct P {
	int x, y;
	P(int x, int y):x(x), y(y){}
	P(){}
};

/** Problem1240 : Unreliable Message **/
int main()
{
	int N; cin>>N;
	rep(z, N) {
		string k, s, ns;
		cin>>k>>s;
		int l=(int)s.size();
		
		rep(i, k.size()) {
			ns="";
			switch(k[k.size()-1-i]) {
				case 'J':
					rep(j, s.size()) {
						ns += s[(l-1+j)%l];
					}
					break;
				case 'C':
					rep(j, s.size()) {
						ns += s[(j+1)%l];
					}
					break;
				case 'E':
					if (l%2==0) {
						ns += s.substr(l/2, l/2);
						ns += s.substr(0, l/2);
					} else {
						ns += s.substr(l/2+1, l/2);
						ns += s[l/2];
						ns += s.substr(0, l/2);
					}
					break;
				case 'A':
					rep(j, l) {
						ns += s[l-1-j];
					}
					break;
				case 'P':
					rep(j, l) {
						if (isdigit(s[j])) {
							if (s[j]=='0')
								ns+='9';
							else
								ns+=s[j]-1;
						} else {
							ns += s[j];
						}
					}
					break;
				case 'M':
					rep(j, l) {
						if (isdigit(s[j])) {
							if (s[j]=='9')
								ns+='0';
							else
								ns+=s[j]+1;
						} else {
							ns += s[j];
						}
					}
					break;
			}
			
			s = ns;
		}
		cout << s << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
 
int n;
string s,name;
 
string solve();
 
int main(){
    cin >> n;
    for(int i = 0;i < n; ++i){
        cin >> name >> s;
        cout << solve() << endl;
    }
    return 0;
}
 
string solve(){
    reverse(name.begin(),name.end());
    int nsize = name.size(), ssize = s.size(), half = s.size() / 2;
    for(int i = 0;i < nsize;++i){
        string tmp;
        switch(name[i]){
            case 'J':
                tmp = s[ssize-1] + s;
                tmp.pop_back();
                s = tmp;
                break;
            case 'C':
                for(int j = 1;j < ssize;++j)tmp += s[j];
                tmp += s[0];
                s = tmp;
                break;
            case 'E':
                for(int j = 0;j < half;++j)tmp += s[half + ssize % 2 + j];
                if(ssize%2)tmp += s[half];
                for(int j = 0;j < half;++j)tmp += s[j];
                s = tmp;
                break;
            case 'A':
                reverse(s.begin(),s.end());
                break;
            case 'P':
                for(int j = 0;j < ssize;++j)
                    if(s[j] >= '0' && s[j] <= '9')
                        s[j] = '0' + (s[j] - '0' + 9) % 10;
                break;
            case 'M':
                for(int j = 0;j < ssize;++j)
                    if(s[j] >= '0' && s[j] <= '9')
                        s[j] = '0' + (s[j] - '0' + 1) % 10;
                break;
            default:
                assert(0);
                break;
        }
    }
    return s;
}

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

string dec(string str,char c){
	if(c=='J'){
		int e=str.size()-1;
		str=str[e]+str;
		str.pop_back();
	}
	else if(c=='C'){
		str=str+str[0];
		str.erase(str.begin());
	}
	else if(c=='E'){
		int t=0;
		while(2*t<(str.size()-1)){
			swap(str[t],str[(str.size()+1)/2+t]);
			t++;
		}
	}
	else if(c=='A'){
		reverse(str.begin(),str.end());
	}
	else if(c=='P'){	
		for(int i=0;i<str.size();i++){
			if(str[i]>='0' && str[i]<='9')str[i]=((str[i]-'0')+9)%10+'0';
		}
	}
	else if(c=='M'){
		for(int i=0;i<str.size();i++){
			if(str[i]>='0' && str[i]<='9')str[i]=((str[i]-'0')+1)%10+'0';
		}
	}
	return str;
}

int main(){
	int n;
	cin>>n;
	while(n--){
		string ord,mes;
		cin>>ord>>mes;
		reverse(ord.begin(),ord.end());
		for(int i=0;i<ord.size();i++){
			mes=dec(mes,ord[i]);
		}
		cout<<mes<<endl;
	}
}