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>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-11;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

int n;

int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		string s,t;
		cin>>s>>t;
		int m=s.size();
		int N=t.size();
		for(int j=m-1;j>=0;j--){
			string u;
			if(s[j]=='J') u=t[N-1]+t.substr(0,N-1);
			if(s[j]=='C') u=t.substr(1,N-1)+t[0];
			if(s[j]=='E'){
				if(N%2==0) u=t.substr(N/2,N/2)+t.substr(0,N/2);
				else u=t.substr(N/2+1,N/2)+t[N/2]+t.substr(0,N/2);
			}
			if(s[j]=='A'){
				u=t;
				reverse(u.begin(),u.end());
			}
			if(s[j]=='P'){
				u=t;
				for(int k=0;k<N;k++) if(isdigit(u[k])){
					if(u[k]=='0') u[k]='9';
					else u[k]--;
				}
			}
			if(s[j]=='M'){
				u=t;
				for(int k=0;k<N;k++) if(isdigit(u[k])){
					if(u[k]=='9') u[k]='0';
					else u[k]++;
				}
			}
			t=u;
		}
		cout<<t<<endl;
	}
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<cstdlib>
#include<sstream>
#include<queue>
#include<deque>
#include<cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#include<iomanip>
#define INF 2147483647
#define lli long long int
#define MOD 1000000007

using namespace std;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;

int main() {

	int n; cin >> n;
	for (int i = 0 ; i < n; i++) {
		string trans; cin >> trans;
		string org; cin >> org;

		for (int i = 0; i < trans.size(); i++){
			if (trans[i] == 'J'){
				string str1 = org.substr(0,1);	
				string str2 = org.substr(1,org.size()-1);	
				org = str2 + str1;
			}else if (trans[i] == 'C'){
				string str1 = org.substr(0,org.size()-1);	
				string str2 = org.substr(org.size()-1,1);	
				org = str2 + str1;
			}else if (trans[i] == 'E'){
				if (org.size() % 2 == 0){
					string str1 = org.substr(0,org.size()/2);	
					string str2 = org.substr((org.size()/2),org.size()-(org.size()/2));	
					org = str2 + str1;
				}else{
					string str1 = org.substr(0,org.size()/2);	
					string str2 = org.substr((org.size()/2),1);	
					string str3 = org.substr((org.size()/2)+1,org.size()-(org.size()/2));	
					org = str3 + str2 + str1;
				}

			}else if (trans[i] == 'A'){
				reverse(org.begin(),org.end());
			}else if (trans[i] == 'P'){
				for (int j = 0; j < org.size(); j++){
					if (isdigit(org[j])){
						int tmp = (org[j] - 48 + 1 + 10 )%10;
						org[j] = (tmp + '0');	
					}
				}
			}else if (trans[i] == 'M'){
				for (int j = 0; j < org.size(); j++){
					if (isdigit(org[j])){
						int tmp = (org[j] - 48 - 1 + 10)%10;
						org[j] = (tmp + '0');	
					}
				}
			}
		}

		cout << org << endl;

	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

using i64 = int64_t;

string J(string s){
    char c = s.back();
    s.pop_back();
    return c + s;
}

string C(string s){
    char c = s[0];
    s = s.substr(1, s.size()-1);
    return s + c;
}

string E(string s){
    string left = s.substr(0, s.size()/2);
    string right = s.substr(s.size()/2 + s.size()%2, s.size()/2);
    string res = right;
    if(s.size() % 2)res += s[s.size()/2];
    res += left;
    return res;
}

string A(string s){
    reverse(s.begin(), s.end());
    return s;
}

string P(string s){
    string res;
    for(auto c: s){
        if(c >= '0' && c <= '9'){
            if(c == '0')c = '9';
            else c--;
        }
        res.push_back(c);
    }
    return res;
}

string M(string s){
    string res;
    for(auto c: s){
        if(c >= '0' && c <= '9'){
            if(c == '9')c = '0';
            else c++;
        }
        res.push_back(c);
    }
    return res;
}

int main(){
    int n;
    cin >> n;
    for(int i=0;i<n;++i){
        string s;
        cin >> s;
        string mes;
        cin >> mes;
        reverse(s.begin(), s.end());
        for(auto c: s){
            if(c == 'J'){
                mes = J(mes);
            }else if(c == 'C'){
                mes = C(mes);
            }else if(c == 'E'){
                mes = E(mes);
            }else if(c == 'A'){
                mes = A(mes);
            }else if(c == 'P'){
                mes = P(mes);
            }else{
                mes = M(mes);
            }
        }
        cout << mes << endl;
    }

    return 0;
}