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++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std; 

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;

string num = "0123456789";

int main()
{
	int n; cin>>n;
	while (n--) {
		string ord; cin>>ord;
		string s; cin>>s;
		reverse(all(ord));
		rep(i,0,len(ord)) {
			string t = s;
			if (ord[i]=='J') {
				s = t.back();
				s += t.substr(0,len(t)-1);
			}
			if (ord[i]=='C') {
				s = t.substr(1,len(t)-1);
				s += t.front();
			}
			if (ord[i]=='E') {
				if (len(s)%2) {
					int c = len(s)/2;
					s = t.substr(c+1, len(s)-(c+1));
					s += t[c];
					s += t.substr(0, c);
				}
				else {
					int c = len(s)/2;
					s = t.substr(c, len(s)-c);
					s += t.substr(0, c);
				}
			}
			if (ord[i]=='A') {
				reverse(all(s));
			}
			if (ord[i]=='P') {
				rep(j,0,len(s)) {
					int idx = num.find(s[j]);
					if (idx != std::string::npos) {
						s[j] = num[(len(num)+idx-1)%len(num)];
					}
				}
			}
			if (ord[i]=='M') {
				rep(j,0,len(s)) {
					int idx = num.find(s[j]);
					if (idx != std::string::npos) {
						s[j] = num[(len(num)+idx+1)%len(num)];
					}
				}
			}
		}
		cout << s << endl;
	}

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <iomanip>

#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>

#include <numeric>
#include <algorithm>
#include <functional>

#include <cctype>

#include <complex>
#include <string>
#include <sstream>

using namespace std;

#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(),c.rend()
#define rep(i,n) for(unsigned int i=0;i<(n);i++)
#define tr(it,container) for(typeof(container.begin()) it = container.begin(); \
                             it != container.end(); ++it)
#define mp(a,b) make_pair((a),(b))

typedef long long ll;
typedef complex<double> P;
const int dx[] = {1,0,-1,0};
const int dy[] = {0,-1,0,1};
const double EPS = 1e-9;
const int days[] = {31,28,31,30,31,30,31,31,30,31,30,31};
const int daysleap[] = {31,29,31,30,31,30,31,31,30,31,30,31};

int main(){
    int n;
    cin >> n;
    rep(i,n){
        string OM;
        string ME;
        cin >> OM >> ME;
        reverse(all(OM));
        rep(j,OM.length()){
            int m = OM[j];
            switch(m){
            case 'J':
                rotate(ME.begin(),ME.end()-1,ME.end());
                break;
            case 'C':
                rotate(ME.begin(),ME.begin()+1,ME.end());
                break;
            case 'E':
                // a b c d
                if(ME.length() % 2 == 0) ME = ME.substr(ME.length()/2) + ME.substr(0,ME.length()/2);
                // a b c d e
                else ME = ME.substr(ME.length()/2+1) + ME[ME.length()/2] + ME.substr(0,ME.length()/2);
                break;
            case 'A':
                reverse(all(ME));
                break;
            case 'P':
            {
                string ret = "";
                rep(k,ME.length()){
                    if('0' <= ME[k] and ME[k] <= '9'){
                        if(ME[k] == '0') ret += '9';
                        else ret += ME[k]-1;
                    }else{
                        ret += ME[k];
                    }
                }
                ME = ret;
            }
            break;
            case 'M':
            {
                string ret = "";
                rep(k,ME.length()){
                    if('0' <= ME[k] and ME[k] <= '9'){
                        if(ME[k] == '9') ret += '0';
                        else ret += ME[k]+1;
                    }else{
                        ret += ME[k];
                    }
                }
                ME = ret;
            }
            }

        }
        cout << ME << endl;
    }
    return 0;
}