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 <bits/stdc++.h>

using namespace std;

#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for(int i = (int)(n - 1); i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SQ(n) (n) * (n)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vc> vvc;
typedef vector<vll> vvll;

int main() {
  int n;
  cin >> n;
  REP(_, n){
    string order, message;
    cin >> order >> message;
    int l = ceil(message.length() / 2.);

    RREP(io, order.length()){
      auto o = order[io];
      switch (o) {
      case 'J':
        rotate(message.begin(), message.end() - 1, message.end());
        break;
      case 'C':
        rotate(message.begin(), message.begin() + 1, message.end());
        break;
      case 'E':
        REP(i, message.length() / 2){
          swap(message[i], message[i + l]);
        }
        break;
      case 'A':
        reverse(ALL(message));
        break;
      case 'P':
        REP(i, message.length()){
          if (!isdigit(message[i])) continue;
          message[i] = (message[i] - '0' + 9) % 10 + '0';
        }
        break;
      case 'M':
        REP(i, message.length()){
          if (!isdigit(message[i])) continue;
          message[i] = (message[i] - '0' + 1) % 10 + '0';
        }
        break;
      }
    }
    cout << message << endl;
  }
}

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

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX/3

#define MAX_N 1000

int n;

string f(string s,bool flag){
	string res="";
	rep(i,s.length()){
		if(isdigit(s[i])){
			char c=s[i];
			if(flag)c++;
			else c--;
			if(c>'9')c='0';
			if(c<'0')c='9';
			res+=c;
		}else res+=s[i];
	}
	return res;
}

int main(){
	cin.sync_with_stdio(false);
	cin>>n;
	rep(h,n){
		string s,op;
		cin>>op>>s;
		reverse(all(op));
		int l=s.length();
		string res;
		rep(i,op.length()){
			if(op[i]=='C'){
				s=s.substr(1,l-1)+s[0];
			}else if(op[i]=='J'){
				s=s[l-1]+s.substr(0,l-1);
			}else if(op[i]=='E'){
				if(l%2==1)s=s.substr(l/2+1,l/2)+s[l/2]+s.substr(0,l/2);
				else s=s.substr(l/2,l/2)+s.substr(0,l/2);
			}else if(op[i]=='A'){
				reverse(all(s));
			}else if(op[i]=='P'){
				s=f(s,false);
			}else if(op[i]=='M'){
				s=f(s,true);
			}
		}
		cout<<s<<endl;
	}
	return 0;
}

C++: #include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int main() {
    int N,i,j,k,q;char T[50],c[9];scanf("%d",&N);while (N--) {
        scanf("%s%s",&c,&T);j=strlen(c),k=strlen(T)-1;
        while (j--) {
            if (c[j]=='P') {
                for (i=k;i>=0;i--) {if (T[i]>='1' && T[i]<='9') T[i]--; else if (T[i]=='0') T[i]='9';}
            } else if (c[j]=='M') {
                for (i=k;i>=0;i--) {if (T[i]>='0' && T[i]<='8') T[i]++; else if (T[i]=='9') T[i]='0';}
            } else if (c[j]=='E') {
                for (i=k,q=(k-1)/2;q>=0;i--,q--) swap(T[i],T[q]);
            } else if (c[j]=='A') {
                for (i=0,q=k;i<q;i++,q--) swap(T[i],T[q]);
            } else if (c[j]=='J') {
                c[8]=T[k];for (i=k;i>0;i--) T[i]=T[i-1];T[0]=c[8];
            } else {
                c[8]=T[0];for (i=0;i<k;i++) T[i]=T[i+1];T[k]=c[8];
            }
        }
        puts(T);
    }
}