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 <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
 
using namespace std;

string J(string s){
	string t=s;
	t=t[t.size()-1]+t;
	t.erase(t.end()-1);
	return t;
}

string C(string s){
	string t=s;
	t=t+t[t.size()-1];
	t.erase(t.begin());
	return t;
}

string E(string s){
	string t=s;
	for(int i=0;i<t.size()/2;i++){
		swap(t[i],t[t.size()-1-i]);
	}

	return t;
}

string A(string s){
	string t=s;
	reverse(t.begin(),t.end());
	return t;
}

string P(string s){
	string t=s;
	for(int i=0;i<t.size();i++){
		if( '0'<=t[i] && t[i]<='9' ){
			if(t[i]=='0') t[i]='9';
			else t[i]--;
		}
	}
	return t;
}

string M(string s){
	string t=s;
	for(int i=0;i<t.size();i++){
		if( '0'<=t[i] && t[i]<='9' ){
			if(t[i]=='9') t[i]='0';
			else t[i]++;
		}
	}
	return t;
}

int main(){

	int n;
	cin>>n;

	for(int i=0;i<n;i++){
		string t,s;
		cin>>t>>s;
		for(int j=t.size()-1;j>=0;j--){
			if(t[j]=='J') s=J(s);
			else if(t[j]=='C') s=C(s);
			else if(t[j]=='E') s=E(s);
			else if(t[j]=='A') s=A(s);
			else if(t[j]=='P') s=P(s);
			else if(t[j]=='M') s=M(s);
		}
		cout<<s<<endl;
	}

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <unordered_map>
#include <functional>

using namespace std;

#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)

int main()
{
	unordered_map<char,function<string(string)>> inv;
	inv['J']=[](string s){
		rotate(s.begin(),s.end()-1,s.end());
		return s;
	};
	inv['C']=[](string s){
		rotate(s.begin(),s.begin()+1,s.end());
		return s;
	};
	inv['E']=[](string s){
		rep(i,s.size()/2) swap(s[i],s[(s.size()+1)/2+i]);
		return s;
	};
	inv['A']=[](string s){
		return string(s.rbegin(),s.rend());
	};
	inv['P']=[](string s){
		char ds[]="9012345678";
		rep(i,s.size()) if(isdigit(s[i])) s[i]=ds[s[i]-'0'];
		return s;
	};
	inv['M']=[](string s){
		char ds[]="1234567890";
		rep(i,s.size()) if(isdigit(s[i])) s[i]=ds[s[i]-'0'];
		return s;
	};
	
	int tc; cin>>tc;
	while(tc--){
		string m,s; cin>>m>>s;
		per(i,m.size()) s=inv[m[i]](s);
		cout<<s<<endl;
	}
	
	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
  int n,l;
  string o,k;
  cin>>n;
  while(n--){
    cin>>o>>k;
    int l=k.size();
    for(int i=o.size()-1;i>=0;i--){
      if(o[i]=='J')
	k=k[l-1]+k.substr(0,l-1);
      else if(o[i]=='C')
	k=k.substr(1,l-1)+k[0];
      else if(o[i]=='E'){
	if(l%2)
	  k=k.substr(l/2+1)+k[l/2]+k.substr(0,l/2);
	else
	  k=k.substr(l/2)+k.substr(0,l/2);
      }
      else if(o[i]=='A')
	reverse(k.begin(),k.end());
      else if(o[i]=='P'){
	for(int j=0;j<l;j++){
	  if('1'<=k[j]&&k[j]<='9')
	    k[j]--;
	  else if(k[j]=='0')
	    k[j]='9';
	}
      }
      else if(o[i]=='M'){
	for(int j=0;j<l;j++){
	  if('0'<=k[j]&&k[j]<='8')
	    k[j]++;
	  else if(k[j]=='9')
	    k[j]=0;
	}
      }
    }
    cout<<k<<endl;
  }
  return 0;
}

C++: #include <iostream> 
#include <string> 
#include <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
 
using namespace std;

string J(string s){

	int n=s.size();
	string t;
	for(int i=0;i<n;i++){
		t+=s[(n-1+i)%n];
	}
	return t;

}

string C(string s){
	int n=s.size();
	string t;
	for(int i=0;i<n;i++){
		t+=s[(1+i)%n];
	}
	return t;
}

string E(string s){
	string t;
	if(s.size()%2){
		string left=s.substr(0,s.size()/2);
		char mid=s[s.size()/2];
		string right=s.substr(s.size()/2+1);
		t=left+mid+right;
	}else{
		string left=s.substr(0,s.size()/2);
		string right=s.substr(s.size()/2);
		t=left+right;
	}

	return t;
}

string A(string s){
	string t=s;
	reverse(t.begin(),t.end());
	return t;
}

string P(string s){
	string t=s;
	for(int i=0;i<t.size();i++){
		if( '0'<=t[i] && t[i]<='9' ){
			if(t[i]=='0') t[i]='9';
			else t[i]--;
		}
	}
	return t;
}

string M(string s){
	string t=s;
	for(int i=0;i<t.size();i++){
		if( '0'<=t[i] && t[i]<='9' ){
			if(t[i]=='9') t[i]='0';
			else t[i]++;
		}
	}
	return t;
}

int main(){

	int n;
	cin>>n;

	for(int i=0;i<n;i++){
		string t,s;
		cin>>t>>s;
		for(int j=t.size()-1;j>=0;j--){
			if(t[j]=='J') s=J(s);
			else if(t[j]=='C') s=C(s);
			else if(t[j]=='E') s=E(s);
			else if(t[j]=='A') s=A(s);
			else if(t[j]=='P') s=P(s);
			else if(t[j]=='M') s=M(s);
		}
		cout<<s<<endl;
	}

	return 0;
}