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<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j,k;
  int n;
  cin>>n;
  rep(i,n){
    string ord,s;
    cin>>ord;
    cin>>s;
    int len=s.size();
    for(j=ord.size()-1;j>=0;j--){
      if(ord[j]=='C'){
	string tmp="";
	tmp.push_back(s[0]);
	s.erase(s.begin());
	s+=tmp;
      }else if(ord[j]=='J'){
	string tmp="";
	tmp.push_back(s[len-1]);
	s.erase(s.end()-1);
	s=tmp+s;
      }else if(ord[j]=='A'){
	reverse(all(s));
      }else if(ord[j]=='E'){
	rep(k,len/2)
	  swap(s[k],s[(len+1)/2+k]);
      }else if(ord[j]=='M'){
	rep(k,len)
	  if(s[k]<='8' && s[k]>='0')s[k]++;
	  else if(s[k]=='9')s[k]='0';
      }else{
	rep(k,len)
	  if(s[k]<='9' && s[k]>'0')s[k]--;
	  else if(s[k]=='0')s[k]='9';
      }
    }
    cout<<s<<endl;
  }
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include <utility>
using namespace std;

string dec(string str,char c){
	if(c=='J'){
		int e=str.size()-1;
		str=str[e]+str;
		str.pop_back();
	}
	else if(c=='C'){
		str=str+str[0];
		str.erase(str.begin());
	}
	else if(c=='E'){
		int t=0;
		while(2*t<(str.size()-1)){
			swap(str[t],str[(str.size()+1)/2+t]);
			t++;
		}
	}
	else if(c=='A'){
		reverse(str.begin(),str.end());
	}
	else if(c=='P'){	
		for(int i=0;i<str.size();i++){
			if(str[i]>='0' && str[i]<='9')str[i]=((str[i]-'0')+9)%10+'0';
		}
	}
	else if(c=='M'){
		for(int i=0;i<str.size();i++){
			if(str[i]>='0' && str[i]<='9')str[i]=((str[i]-'0')+1)%10+'0';
		}
	}
	return str;
}

int main(){
	int n;
	cin>>n;
	while(n--){
		string ord,mes;
		cin>>ord>>mes;
		reverse(ord.begin(),ord.end());
		for(int i=0;i<ord.size();i++){
			mes=dec(mes,ord[i]);
		}
		cout<<mes<<endl;
	}
}

C++: #include<iostream>
#include<string>
#include<algorithm>
using namespace std;

string A(string s){
  reverse(s.begin(), s.end());
  return s;
}
string C(string s){
  return s.substr(1, s.length() - 1) + s[0];
}
string J(string s){
  return s.back() + s.substr(0, s.length() - 1);
}
string E(string s){
  string res = s.substr((s.length() + 1)/2);
  if(s.length()%2 != 0)res += s[s.length()/2];
  res += s.substr(0, s.length()/2);
  return res;
}

string M(string s){
  string res = s;
  for (int i = 0; i < s.length(); i++) {
    if('0' <= res[i] and res[i] < '9'){
      res[i]++;
    }else if(res[i] == '9'){
      res[i] = '0';
    }
  }
  return res;
}

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

int main(){
  int n;
  std::cin >> n;
  for (int roop = 0; roop < n; roop++) {
    string ope, s;
    std::cin >> ope >> s;
    reverse(ope.begin(), ope.end());
    for (int i = 0; i < ope.length(); i++) {
      if(ope[i] == 'A'){
        s = A(s);
      }else if(ope[i] == 'E'){
        s = E(s);
      }else if(ope[i] == 'C'){
        s = C(s);
      }else if(ope[i] == 'J'){
        s = J(s);
      }else if(ope[i] == 'M'){
        s = M(s);
      }else if(ope[i] == 'P'){
        s = P(s);
      }else{
        std::cerr << "hoge" << std::endl;
      }
    }
    std::cout << s << std::endl;

  }
  return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main(int argc, char const *argv[])
{
	string order;
	string mess;

	int n;
	int sz;

	cin>>n;

	for(int i1=0;i1<n;i1++){
		cin>>order;
		cin>>mess;

		reverse(order.begin(), order.end());
		sz=mess.size();

		for(int i2=0;i2<order.size();i2++){
			if(order[i2]=='J'){
				mess=mess[sz-1]+mess.substr(0,sz-1);
			}
			else if(order[i2]=='C'){
				mess=mess.substr(1,sz-1)+mess[0];
			}
			else if(order[i2]=='E'){
				string l,r;
				l=mess.substr(0,sz/2);
				
				if(sz%2==0){	
					r=mess.substr(sz/2,sz/2);
					mess=r+l;
				}
				else {
					r=mess.substr(sz/2+1,sz/2);
					mess=r+mess[sz/2]+l;
				}
			}
			else if(order[i2]=='A'){
				reverse(mess.begin(), mess.end());
			}
			else if(order[i2]=='P'){
				for(int i3=0;i3<sz;i3++){
					if(mess[i3]>='1' && mess[i3]<='9') mess[i3]--;
					else if(mess[i3]=='0') mess[i3]='9';
				}
			}
			else {// M
				for(int i3=0;i3<sz;i3++){
					if(mess[i3]>='0' && mess[i3]<='8') mess[i3]++;
					else if(mess[i3]=='9') mess[i3]='0';
				}
			}
		}

		cout<<mess<<endl;

	}

	return 0;
}