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<algorithm>
#include<string>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int cs,s;string ord,st;
void op(char o){
	if(o=='A')reverse(st.begin(),st.end());
	if(o=='J')rotate(st.rbegin(),st.rbegin()+1,st.rend());
	if(o=='C')rotate(st.begin(),st.begin()+1,st.end());
	if(o=='E')swap_ranges(st.begin(),st.begin()+s/2,st.begin()+(s+1)/2);
	if(o=='P'||o=='M')rep(i,s)if('0'<=st[i]&&st[i]<='9')
	st[i]=(st[i]-'0'+(o=='P'?9:1))%10+'0';
}
int main(){
	cin>>cs;
	while(cs--){
		cin>>ord>>st;s=st.size();
		rep(i,ord.size())op(ord[ord.size()-1-i]);
		cout<<st<<endl;
	}
	return 0;
}

C++: null

C++: 
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;

#define For(i,a,b)	for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define rall(a)		(a).rbegin(), (a).rend()
#define sz(a)		(sizeof(a))
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
const int mod = 1000000007;
const int INF = 1e9;


int main()
{
	int n;
	cin >> n;
	rep(_, n){

		string s, w;
		cin >> w >> s;
		int l = s.size();

		for (int i = w.size() - 1; i >= 0;i--){

			if (w[i] == 'J')
				s = s[l - 1] + s.substr(0, l - 1);         
			if (w[i] == 'C')
				s = s.substr(1, l - 1) + s[0];
			if (w[i] == 'E'){
				string t = s;
				s = t.substr(l - l / 2, l / 2);
				if(l % 2)s += t[l / 2];
				s += t.substr(0, l / 2);
			}
			if (w[i] == 'A')
				reverse(all(s));
			if (w[i] == 'P')	
				rep(j, l)if (s[j] >= '0' && s[j] <= '9')s[j] = (s[j] == '0' ? '9' : s[j] - 1);
			if (w[i] == 'M')
				rep(j, l)if (s[j] >= '0' && s[j] <= '9')s[j] = (s[j] == '9' ? '0' : s[j] + 1);

		}

		cout << s << endl;
	}

	return 0;
}

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

//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);

string A(string s) {
	reverse(all(s));
	return s;
}

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

string M(string s) {
	rep(i, 0, s.size()) {
		if (isdigit(s[i])) {
			s[i] = char((s[i] - '0' + 1 + 26) % 26 + '0');
		}
	}
	return s;
}

string P(string s) {
	rep(i, 0, s.size()) {
		if (isdigit(s[i])) {
			s[i] = char((s[i] - '0' - 1 + 26) % 26 + '0');
		}
	}
	return s;
}

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

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

signed main() {
	int n; cin >> n;
	rep(h, 0, n) {
		string o; cin >> o;
		string m; cin >> m;
		rrep(i, 0, o.size()) {
			if (o[i] == 'J')m = J(m);
			if (o[i] == 'C')m = C(m);
			if (o[i] == 'E')m = E(m);
			if (o[i] == 'A')m = A(m);
			if (o[i] == 'P')m = P(m);
			if (o[i] == 'M')m = M(m);
		}
		cout << m << endl;
	}
	return 0;
}