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<algorithm>
#include<cctype>
using namespace std;main(){int n,i,j,M;string p,m;for(cin>>n;n-->0;cout<<m<<endl){cin>>p>>m;M=m.size();for(i=p.size();i-->0;){if(p[i]==74)m=m[M-1]+m.substr(0,M-1);if(p[i]==67)m=m.substr(1,M-1)+m[0];if(p[i]==69){if(M&1)m=m.substr(M/2+1,M/2)+m[M/2]+m.substr(0,M/2);else m=m.substr(M/2,M/2)+m.substr(0,M/2);}if(p[i]==65)reverse(m.begin(),m.end());if(p[i]==80)for(j=M;j-->0;)if(isdigit(m[j]))m[j]=(m[j]-39)%10+48;if(p[i]==77)for(j=M;j-->0;)if(isdigit(m[j]))m[j]=(m[j]-47)%10+48;}}}

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;
int main(){
  int n;
  cin>>n;
  while(n--){
    string q,s;
    cin>>q>>s;
    for(int i=q.size()-1;0<=i;i--){
      if(q[i]=='C')s=s.substr(1,s.size()-1)+s[0];
      if(q[i]=='J')s=s[s.size()-1]+s.substr(0,s.size()-1);
      if(q[i]=='E')
	for(int j=0;j<s.size()/2;j++)swap(s[j],s[(s.size()+1)/2+j]);
      if(q[i]=='A')reverse(s.begin(),s.end());
      if(q[i]=='P')
	for(int j=0;j<s.size();j++)
	  if(isdigit(s[j]))s[j]=((s[j]-'0'+10)-1)%10+'0';
      if(q[i]=='M')
	for(int j=0;j<s.size();j++)
	  if(isdigit(s[j]))s[j]=((s[j]-'0')+1)%10+'0';
    }
    cout<<s<<endl;
  }
  return 0;
}

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

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