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>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
	int n;
	cin>>n;
	while(n--){
		string a,s;
		cin>>a>>s;
		reverse(all(a));
		rep(i,a.size()){
			if(a[i]=='A')
				reverse(all(s));
			else if(a[i]=='J')
				s=s.substr(s.size()-1)+s.substr(0,s.size()-1);
			else if(a[i]=='M'){
				rep(j,s.size())if(isdigit(s[j])){
					s[j]++;
					if(s[j]=='9'+1)s[j]='0';
				}
			}else if(a[i]=='P'){
				rep(j,s.size())if(isdigit(s[j])){
					s[j]--;
					if(s[j]=='0'-1)s[j]='9';
				}
			}else if(a[i]=='C')
				s=s.substr(1)+s.substr(0,1);
			else if(a[i]=='E'){
				string tmp="";
				int t=0;
				if(s.size()%2){t=1;tmp=s[s.size()/2];}
				s=s.substr(s.size()/2+t)+tmp+s.substr(0,s.size()/2);
			}
		}
		cout<<s<<endl;
	}
}

C++: #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;

long long int power(long long int x, long long int n, long long int M) {
	long long int tmp = 1;

	if (n > 0) {
		tmp = power(x, n / 2, M);
		if (n % 2 == 0) tmp = (tmp*tmp) % M;
		else tmp = (((tmp*tmp) % M)*x) % M;
	}
	return tmp;
}

long long int N, M, K, Q, W, H, L, R;
long long int ans;



int main() {
	ios::sync_with_stdio(false);
	cin >> N;
	for (int i = 0; i < N; i++) {
		string a, b;
		cin >> a >> b;
		for (auto j = a.rbegin(); j != a.rend(); ++j) {
			if (*j == 'J') {
				char c;
				c = b.back();
				b.pop_back();
				b = c + b;
			}
			if (*j == 'C') {
				char c;
				c = b[0];
				for (int k = 0; k < b.size() - 1; k++) {
					b[k] = b[k + 1];
				}
				b[b.size() - 1] = c;
			}
			if (*j == 'E') {
				string s, t;
				for (int k = 0; k < b.size() / 2; k++) {
					s += b[k];
				}
				for (int k = (b.size() + 1) / 2; k < b.size(); k++) {
					t += b[k];
				}
				for (int k = 0; k < b.size() / 2; k++) {
					b[k] = t[k];
				}
				for (int k = (b.size() + 1) / 2; k < b.size(); k++) {
					b[k] = s[k - (b.size() + 1) / 2];
				}
			}
			if (*j == 'A') {
				for (int k = 0; k < b.size() / 2; k++)swap(b[k], b[b.size() - 1 - k]);
			}
			if (*j == 'M') {
				for (int k = 0; k < b.size(); k++) {
					if (b[k] >= '0'&&b[k] <= '9') {
						b[k]++;
						if (b[k] == char('9' + 1))b[k] = '0';
					}
				}
			}
			if (*j == 'P') {
				for (int k = 0; k < b.size(); k++) {
					if (b[k] >= '0'&&b[k] <= '9') {
						b[k]--;
						if (b[k] == char('0' - 1))b[k] = '9';
					}
				}
			}
		}
		cout << b << endl;
	}
	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;
	while (~scanf("%d", &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<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;

int main() {
	int n; scanf("%d", &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;
	}
}