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 <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <iterator>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) container.begin(), container.end()
#define RALL(container) container.rbegin(), container.rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int n;

main(){
	cin >> n;
	while(n --){
		string s,t;
		cin >> s >> t;
		RREP(i, s.size()){
			if(s[i] == 'P') FOR(c, t) if(isdigit(*c) && !isdigit(--*c)) *c = '9';
			if(s[i] == 'M') FOR(c, t) if(isdigit(*c) && !isdigit(++*c)) *c = '0';
			if(s[i] == 'A') reverse(ALL(t));
			if(s[i] == 'J') t = t[t.size()-1] + t.substr(0, t.size()-1);
			if(s[i] == 'C') t = t.substr(1, t.size()-1) + t[0];
			if(s[i] == 'E') REP(i, t.size()/2) swap(t[i], t[t.size()-t.size()/2+i]);
			
		}
		cout << t << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define debug 0
int main(){
	/*
	J	先頭を最後尾に
	C	最後尾を先頭に
	E	前半と後半を入れ替える(文字列が奇数なら真ん中は残す)
	A	文字列をひっくり返す
	P	プラス
	M	マイナス
	*/
	int n;
	for(cin>>n;n>0;n--){
		string order,str;
		cin>>order>>str;
		if(debug)cout<<"$"<<str<<endl;
		for(int i=order.size()-1;i>=0;i--){
			if(order[i]=='J'){
				string tmp="";
				tmp+=str[str.size()-1];
				for(int j=0;j<str.size()-1;j++)tmp+=str[j];
				str=tmp;
			}
			if(order[i]=='C'){
				string tmp="";
				for(int j=1;j<str.size();j++)tmp+=str[j];
				tmp+=str[0];
				str=tmp;
			}
			if(order[i]=='E'){
				string tmp="";
				if(str.size()%2){//奇数文字列
					for(int j=str.size()/2+1;j<str.size();j++)tmp+=str[j];
					tmp+=str[str.size()/2];
					for(int j=0;j<str.size()/2;j++)tmp+=str[j];
				}
				else{
					for(int j=str.size()/2;j<str.size();j++)tmp+=str[j];
					for(int j=0;j<str.size()/2;j++)tmp+=str[j];
				}
				str=tmp;
			}
			if(order[i]=='A'){
				reverse(str.begin(), str.end());
			}
			if(order[i]=='P'){
				for(int j=0;j<str.size();j++){
					if('0'<str[j]&&str[j]<='9')str[j]--;
					else if(str[j]=='0')str[j]='9';
				}
			}
			if(order[i]=='M'){
				for(int j=0;j<str.size();j++){
					if('0'<=str[j]&&str[j]<'9')str[j]++;
					else if(str[j]=='9')str[j]='0';
				}
			}
			if(debug)cout<<"#"<<str<<endl;
		}
		cout<<str<<endl;
	}
	
	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':
			if (sz == 1) break;
			m = m[sz - 1] + m.substr(0, sz - 1);
			break;
		case 'C':
			if (sz == 1) break;
			m = m.substr(1, sz - 1) + m[0];
			break;
		case 'E':
			if (sz == 1) break;
			if (sz % 2) {
				m = m.substr(sz / 2 + 1, sz / 2) + m[sz / 1] + 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;
}