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;
int main()
{
	int n,i,j,s;
	string o,m,x,y,z;
	string::iterator b,e;
	cin>>n;
	while(n--)
	{
		cin>>o>>m;
		s=m.size();
		for(i=o.size()-1;i>=0;--i)
		{
			b=m.begin(),e=m.end();
			if(o[i]=='J')rotate(b,e-1,e);
			if(o[i]=='C')rotate(b,b+1,e);
			if(o[i]=='E')
			{
				if(s&1)x.assign(b,b+s/2),y=m[s/2],z.assign(b+s/2+1,e);
				else x.assign(b,b+s/2),y="",z.assign(b+s/2,e);
				m=z+y+x;
			}
			if(o[i]=='A')reverse(b,e);
			if(o[i]=='P')for(j=0;j<s;++j)if(isdigit(m[j]))m[j]=(m[j]-'0'+9)%10+'0';
			if(o[i]=='M')for(j=0;j<s;++j)if(isdigit(m[j]))m[j]=(m[j]-'0'+1)%10+'0';
		}
		cout<<m<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
  int n;
  cin >> n;
  for(int k=0;k<n;k++){
    string order,str,buf;
    cin >> order >> str;
    for(int i=order.size()-1;i>=0;i--){
      
      int s=str.size();
      switch(order[i]) {
      case 'J' :
	buf=str;
	for(int j=0;j<s;j++)
	  str[j+1]=buf[j];
	str[0]=buf[s-1];
	break;
      case 'C' : 
	buf=str;
	for(int j=0;j<s;j++)
	  str[j]=buf[j+1];
	str[s-1]=buf[0];
	break;
      case 'E' :
	buf=str;
	for(int j=0;j<s/2;j++){
	  str[j]=buf[j+s-s/2];
	}
	for(int j=s-s/2;j<s;j++){
	  str[j]=buf[j-s+s/2];  
	}
	
	break;
      case 'A' :
	buf=str;
	for(int j=0;j<s/2;j++){
	  str[j]=buf[s-1-j];
	  str[s-1-j]=buf[j];
	}
	break;
      case 'P' :
	for(int j=0;j<s;j++){
	  if(str[j]=='0') str[j]='9';
	  else if('0'<str[j]&&str[j]<='9') str[j]--;
	}
	break;
      case 'M' :
	for(int j=0;j<s;j++){
	  if(str[j]=='9') str[j]='0';
	  else if('0'<=str[j]&&str[j]<'9') str[j]++;
	}
	break;
      }
    }
    cout << str << endl;
  }
  return 0;
}

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

int main() {
	string order, s;
	int n;
	cin >> n;
	for(int i = 0; i < n; ++i){
		cin >> order;
		cin >> s;
		for(int j = order.size() - 1; j >= 0; --j){
			if(order[j] == 'J'){
				s = s[s.size() - 1] + s.substr(0, s.size() - 1);
			}
			if(order[j] == 'C'){
				s = s.substr(1, s.size() - 1) + s[0];
			}
			if(order[j] == 'E'){
				for(int k = 0; k < s.size() / 2; ++k)
					swap(s[k], s[k + s.size() / 2 + s.size() % 2]);
			}
			if(order[j] == 'A'){
				reverse(s.begin(), s.end());
			}
			if(order[j] == 'P'){
				for(int k = 0; k < s.size(); ++k){
					if('0' <= s[k] && s[k] <= '9'){
						if(s[k] == '0')
							s[k] = '9';
						else
							s[k] -= 1;
					}
				}
			}
			if(order[j] == 'M'){
				for(int k = 0; k < s.size(); ++k){
					if('0' <= s[k] && s[k] <= '9'){
						if(s[k] == '9')
							s[k] = '0';
						else
							s[k] += 1;
					}
				}
			}
		}
		cout << s << endl;
	}
	return 0;
}

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

int main() {
    int C; cin >> C;
    for (int CASE = 0; CASE < C; ++CASE) {
        string S, T; cin >> S >> T;
        int n = (int)T.size();
        reverse(S.begin(), S.end());
        for (auto c : S) {
            string nT = T;
            if (c == 'J') nT = "", nT += T.back(), nT += T.substr(0, n-1);
            else if (c == 'C') nT = T.substr(1) + T[0];
            else if (c == 'E') {
                for (int i = 0; i < n; ++i) {
                    if (i < n/2) nT[i] = T[i + (n+1)/2];
                    else if (i >= (n+1)/2) nT[i] = T[i - (n+1)/2];
                    else nT[i] = T[i];
                }
            }
            else if (c == 'A') {
                reverse(nT.begin(), nT.end());
            }
            else if (c == 'P') {
                for (int i = 0; i < n; ++i) {
                    if (T[i] >= '0' && T[i] <= '9') {
                        int val = T[i] - '0';
                        val = (val + 9) % 10;
                        nT[i] = '0' + val;
                    }
                    else nT[i] = T[i];
                }
            }
            else if (c == 'M') {
                for (int i = 0; i < n; ++i) {
                    if (T[i] >= '0' && T[i] <= '9') {
                        int val = T[i] - '0';
                        val = (val + 1) % 10;
                        nT[i] = '0' + val;
                    }
                    else nT[i] = T[i];
                }
            }
            T = nT;
        }
        cout << T << 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=0;i<q.size();i++){
      if(q[i]=='J')s=s.substr(1,s.size()-1)+s[0];
      if(q[i]=='C')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]=='M')
	for(int j=0;j<s.size();j++)
	  if(isdigit(s[j]))s[j]=((s[j]-'0')+1)%10+'0';
      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';
    }
    cout<<s<<endl;
  }
  return 0;
}