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 <ctype.h>
using namespace std;

int main(){
	int n,t;
	string type,s,a,b,c;
	cin >> n;
	while(n--){
		cin >> type >> s;
		reverse(type.begin(),type.end());
		for(int i=0;i<type.length();i++){
			switch(type[i]){
			case 'J':
				rotate(s.begin(),s.begin()+s.length()-1,s.end());
				break;
			case 'C':
				rotate(s.begin(),s.begin()+1,s.end());
				break;
			case 'E':
				t = s.length();
				a = s.substr(0,t/2);
				b = s.substr(t/2+t%2,t/2);
				c = "";if(t%2)c = s[t/2];
				s = b+c+a;
				break;
			case 'A':
				reverse(s.begin(),s.end());
				break;
			case 'P':
				for(int j=0;j<s.length();j++){
					if( isdigit(s[j]) ){
						s[j] = '0'+(s[j]-'0'+9)%10;
					}
				}
				break;
			case 'M':
				for(int j=0;j<s.length();j++){
					if( isdigit(s[j]) ){
						s[j] = '0'+(s[j]-'0'+1)%10;
					}
				}
				break;
			}
		}
		cout << s << endl;
	}
}

C++: #include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

using namespace std;
string revj(string a)
{
  string answer=a+a;
  return string(answer.begin()+a.size()-1,answer.end()-1);
}
string revc(string a)
{
  string answer=a+a;
  return string(answer.begin()+1,answer.begin()+a.size()+1);
}
string reve(string a)
{
  return string(a.end()-a.size()/2,a.end())+string(a.begin()+a.size()/2,a.end()-a.size()/2)+string(a.begin(),a.begin()+a.size()/2);
}
string reva(string a)
{
  return string(a.rbegin(),a.rend());
}
string revp(string a)
{
  string answer=a;
  REP(i,answer.size()) if(0<= answer[i]-'0' && answer[i]-'0' <= 9) answer[i]=(answer[i]-'0'+9)%10+'0';
  return answer;
}
string revm(string a)
{
  string answer=a;
  REP(i,answer.size()) if(0<= answer[i]-'0' && answer[i]-'0' <= 9) answer[i]=(answer[i]-'0'+1)%10+'0';
  return answer;
}
int main(void)
{
  int n;    
  cin >> n;
  REP(i,n){
    string cmd,tmp;
    cin >> cmd >> tmp;
    string rcmd(cmd.rbegin(),cmd.rend());
    for(auto i:rcmd){
      if(i=='J') tmp=revj(tmp);
      if(i=='C') tmp=revc(tmp);
      if(i=='E') tmp=reve(tmp);
      if(i=='A') tmp=reva(tmp);
      if(i=='P') tmp=revp(tmp);
      if(i=='M') tmp=revm(tmp);
    }
    cout << tmp << endl;
  }
  return 0;
}

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

int main() {

  long long int n;
  cin >> n;

  for ( long long int i = 0; i < n; i++ ) {

    string o, in;
    cin >> o >> in;

    for ( long long int j = o.size() - 1; j >= 0; j-- ) {

      if ( o[j] == 'J' ) {
	in = in[ in.size() - 1 ] + in.substr( 0, in.size() - 1 );
      }else if ( o[j] == 'C' ) {
	in = in.substr( 1, in.size() - 1 ) + in[0];
      }else if ( o[j] == 'E' ) {
	long long int k = in.size() / 2;
	if ( ( in.size() % 2 ) == 0 ) {
	  in = in.substr( k, k ) + in.substr( 0, k );
	}else {
	  in = in.substr( k + 1, k ) + in[k] + in.substr( 0, k );
	}
      }else if ( o[j] == 'A' ) {
	string s = "";
	for ( long long int x = in.size() - 1; x >= 0; x-- ) {
	  s += in[x];
	}
	in = s;
      }else if ( o[j] == 'M' ) {
	for ( long long int x = 0; x < in.size(); x++ ) {
	  if ( in[x] >= '0' && in[x] < '9' ) {
	    in[x]++;
	  }else if ( in[x] == '9' ) {
	    in[x] = '0';
	  }
	}
      }else if ( o[j] == 'P' ) {
	for ( long long int x = 0; x < in.size(); x++ ) {
	  if ( in[x] > '0' && in[x] <= '9' ) {
	    in[x]--;
	  }else if ( in[x] == '0' ) {
	    in[x] = '9';
	  }
	}
      }

    }

    cout << in << endl;

  }

  return 0;

}

C++: #include <cstdio>
#include <string>
#include <algorithm>
#include <cctype>

using namespace std;

int n;
char a_[11], b_[33];

int main(void) {
  scanf("%d", &n);
  while (n--) {
    scanf("%s%s", a_, b_);
    string a = a_, b = b_;
    for (int i = a.size() - 1; i >= 0; i--) {
      if (a[i] == 'J') rotate(b.rbegin(), b.rbegin() + 1, b.rend());
      if (a[i] == 'C') rotate(b.begin(), b.begin() + 1, b.end());
      if (a[i] == 'E') {
        reverse(b.begin(), b.end());
        reverse(b.begin(), b.begin() + (b.size())/2);
        reverse(b.begin() + (b.size() + 1)/2, b.end());
      }
      if (a[i] == 'A') reverse(b.begin(), b.end());
      if (a[i] == 'P') {
        for (int j = 0; j < int(b.size()); j++) {
          if (isdigit(b[j])) {
            b[j] = b[j] == '0' ? '9' : (b[j] - 1);
          }
        }
      }
      if (a[i] == 'M') {
        for (int j = 0; j < int(b.size()); j++) {
          if (isdigit(b[j])) {
            b[j] = b[j] == '9' ? '0' : (b[j] + 1);
          }
        }
      }
    }
    printf("%s\n", b.c_str());
  }
  return 0;
}