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<string>
#include<algorithm>
using namespace std;

string J(string s) {
    string res = s.substr(0, s.size() - 1);
    return s[s.size() - 1] + res;
}

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

string E(string s) {
    int n = s.size();
    string s1 = s.substr(0, n / 2);
    string s2 = s.substr((n + 1) / 2, n / 2);
    if (n % 2) s2 += s[n / 2];
    return s2 + s1;
}

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

string P(string s) {
    for (int i = 0; i < s.size(); i++) {
        if (s[i] >= '0' && s[i] <= '9') {
            if (s[i] == '0') s[i] = '9';
            else s[i]--;
        }
    }
    return s;
}

string M(string s) {
    for (int i = 0; i < s.size(); i++) {
        if (s[i] >= '0' && s[i] <= '9') {
            if (s[i] == '9') s[i] = '0';
            else s[i]++;
        }
    }
    return s;
}

void solve() {
    string s1, s2;
    cin >> s1 >> s2;
    for (int i = s1.size() - 1; i >= 0; i--) {
        if (s1[i] == 'J') s2 = J(s2);
        else if (s1[i] == 'C') s2 = C(s2);
        else if (s1[i] == 'E') s2 = E(s2);
        else if (s1[i] == 'A') s2 = A(s2);
        else if (s1[i] == 'P') s2 = P(s2);
        else s2 = M(s2);
    }
    cout << s2 << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
        solve();
    }
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

string o, m;

void solve() {
	int len = (int)o.size();
	int sz = (int)m.size();
	
	for (int i = len - 1; i >= 0; i--) {
		switch (o[i]) {
		case 'J':
			m = m[sz - 1] + m.substr(0, sz - 1);
			break;
		case 'C':
			m = m.substr(1, sz - 1) + m[0];
			break;
		case 'E':
			if (sz % 2) {
				m = m.substr(sz / 2 + 1, sz / 2) + m[sz / 2] + m.substr(0, sz / 2);
			} else {
				m = m.substr(sz / 2, sz / 2) + m.substr(0, sz / 2);
			}
			break;
		case 'A':
			reverse(m.begin(), m.end());
			break;
		case 'P':
			for (int i = 0; i < sz; i++) {
				if ('1' <= m[i] && m[i] <= '9') {
					char c = m[i] - 1;
					m[i] = c;
				} else if (m[i] == '0') m[i] = '9';
			}
			break;
		case 'M':
			for (int i = 0; i < sz; i++) {
				if ('0' <= m[i] && m[i] <= '8') {
					char c = m[i] + 1;
					m[i] = c;
				} else if (m[i] == '9') m[i] = '0';
			}
			break;
		default:
			break;
		}
	}
	
	cout << m << endl;
}

int main() {
	int n; cin >> n;
	
	for (int i = 0; i < n; i++) {
		cin >> o;
		cin >> m;
		solve();
	}
	
	return 0;
}

C++: #include "bits/stdc++.h"
#define pb push_back
#define mt make_tuple
#define all(a) (a).begin(),(a).end()
#define frep(i,a,n) for(int i=(a);i<(n);++i)
#define rep(i, n) for(int i=0;i<(n);++i)
#define rrep(i, n) for(int i=n-1;i>=0;--i)
#define debug(x) cout << #x << " : " << x << " ------------ " << endl;
using namespace std;
int main()
{
    int n;
    cin >> n;
    while (n--) {
        string o;
        cin >> o;
        string m;
        cin >> m;
        
        rrep (i, o.length()) {
            switch (o[i]) {
                case 'A':
                    reverse(all(m));
                    break;
                case 'J':
                    rotate(m.rbegin(), m.rbegin() + 1, m.rend());
                    break;
                case 'C':
                    rotate(m.begin(), m.begin() + 1, m.end());
                    break;
                case 'P': {
                    auto it = m.begin();
                    while (it != m.end()) {
                        if (isdigit(*it) && --(*it) < '0') *it = '9';
                        ++it;
                    }
                    break; }
                case 'M': {
                    auto it = m.begin();
                    while (it != m.end()) {
                        if (isdigit(*it) && ++(*it) > '9') *it = '0';
                        ++it;
                    }
                    break; }
                case 'E': {
                    int len = m.length();
                    string f = m.substr(0, len / 2);
                    char mdl = m.length() % 2 ? m[len / 2] : 0;
                    string b = m.substr((len + 1) / 2);
                    m = b + mdl + f;
                    break; }
                default:
                    break;
            }
        }
        cout << m << endl;
    }
    return EXIT_SUCCESS;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	while(n--){
		string s,ss;
		cin>>s>>ss;
		for(int i=s.size()-1;i>=0;i--){
			if(s[i]=='P')
				for(int j=0;j<ss.size();j++)
					if(isdigit(ss[j]))
						ss[j]=((ss[j]-'0'+10)-1)%10+'0';
			if(s[i]=='M')
				for(int j=0;j<ss.size();j++)
					if(isdigit(ss[j]))
						ss[j]=(ss[j]-'0'+1)%10+'0';
			if(s[i]=='A')reverse(ss.begin(),ss.end());
			if(s[i]=='E')for(int k=0;k<ss.size()/2;k++)swap(ss[k],ss[(ss.size()+1)/2+k]);
			if(s[i]=='J')ss=ss[ss.size()-1]+ss.substr(0,s.size()-1);
			if(s[i]=='C')ss=ss.substr(1,s.size()-1)+s[0];
		}
		cout<<ss<<endl;
	}
	return 0;
}