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 <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main()
{
	ios_base::sync_with_stdio(0);
	int N; cin >> N;
	rep (i, N ){
		string s; cin >> s;
		string t; cin >> t;
		int n = s.length();
		int m = t.length();
		for (int i = n - 1; i >= 0; i-- ){
			string u = "", u1 = "", u2 = "";
			char c = s[i];
			switch (c ){
  				case 'J':
					u = t.substr (0, t.length() - 1 );
					u  = t[t.length() - 1 ] + u;
					t = u;
				break;
				case 'C':
					u = t.substr (1 );
					u += t[0];
					t = u;
				break; 
				case 'E':
					if (t.length() % 2 == 0 ){
						u1 = t.substr (0, t.length()/2 );
						u2 = t.substr (t.length()/2 );
						u = u2 + u1;
						t = u;
					}else{
						u1 = t.substr (0, t.length()/2 );
						u2 = t.substr (t.length()/2+1 );
						char mid = t[t.length()/2];
						u = u2 + mid + u1;
						t = u;
					} // end if
				break;
				case 'A':
					reverse (ALL(t ) );
				break;
				case 'P':
					rep (j, m ){
						if (isdigit (t[j] ) ){
							t[j] = (char)((t[j] - '0' + 10 - 1 ) % 10 + '0' );
						} // end if
					} // end rep
				break;
				case 'M':
					rep (j, m ){
						if (isdigit (t[j] ) ){
							t[j] = (char)((t[j] - '0' + 1 ) % 10 + '0' );
						} // end if
					} // end rep
				break;
			} // end switch
		} // end for
		cout << t << endl; 
	} // end for
	
	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;

int main() {
	int n; cin >> n;
	rep(i, n) {
		string m, s; cin >> m >> s;
		reverse(m.begin(), m.end());
		for (char c : m) {
			switch (c) {
			case'C':rotate(s.begin(), ++s.begin(), s.end()); break;
			case'J':rotate(s.begin(), --s.end(), s.end()); break;
			case'E':s = s.substr(s.size() / 2 + s.size() % 2) + s.substr(s.size() / 2, s.size() % 2) + s.substr(0, s.size() / 2); break;
			case'A':reverse(s.begin(), s.end()); break;
			case'M':transform(s.begin(), s.end(), s.begin(), [](char c) {
				if (c == '9')return'0';
				if ('0' <= c&&c < '9')return ++c;
			}); break;
			case'P':transform(s.begin(), s.end(), s.begin(), [](char c) {
				if (c == '0')return'9';
				if ('0' < c&&c <= '9')return --c;
			}); break;
			}
		}
		cout << s << endl;
	}
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>

using namespace std;

string c_j(string str);
string c_c(string str);
string c_e(string str);
string c_a(string str);
string c_p(string str);
string c_m(string str);

int main()
{
	int n;
	string order, message;
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> order >> message;
		string ans = message;
		for(int j = order.length()-1; j >= 0; j--){
			if(order[j] == 'J') ans = c_j(ans);
			else if(order[j] == 'C') ans = c_c(ans);
			else if(order[j] == 'E') ans = c_e(ans);
			else if(order[j] == 'A') ans = c_a(ans);
			else if(order[j] == 'P') ans = c_p(ans);
			else if(order[j] == 'M') ans = c_m(ans); 
		}
		cout << ans << endl;
	}
	return 0;
}

string c_j(string str)
{
	char c;
	c = str[str.length()-1];
	str.erase(str.end()-1);
	str = c + str;
	return str;
}

string c_c(string str)
{
	char c;
	c = str[0];
	str.erase(str.begin());
	str += c;
	return str;
}

string c_e(string str)
{
	string a;
	int l = str.length();
	a = str.substr(0, l / 2);
	if( l % 2 == 1){
		char c = str[l / 2];
		str.erase(str.begin(), str.begin() + (l / 2) + 1);
		str += c;
		str += a;
	} else {
		str.erase(str.begin(), str.begin() + (l / 2));
		str += a;
	}
	return str;
}

string c_a(string str)
{
	reverse(str.begin(), str.end());
	return str;
}

string c_p(string str)
{
	for(int i = 0; i < str.length(); i++){
		if(isdigit(str[i])){
			int n = str[i] - '0';
			n--;
			if(n == -1) n = 9;
			str[i] = n + '0';
		}
	}
	return str;
}

string c_m(string str)
{
	for(int i = 0; i < str.length(); i++){
		if(isdigit(str[i])){
			int n = str[i] - '0';
			n = (n + 1) % 10;
			str[i] = n + '0';
		}
	}
	return str;
}