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

int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        string order;
        cin>>order;
        string s;
        cin>>s;
        reverse(order.begin(),order.end());
        for(auto x:order){
            switch(x){
                case 'J':
                    reverse(s.begin(),s.end());
                    string s1=s.substr(0,1),s2=s.substr(1);
                    reverse(s2.begin(),s2.end());
                    s=s1+s2;
                    break;
                case 'C':
                    string s1=s.substr(0,1),s2=s.substr(1);
                    s=s2+s1;
                    break;
                case 'E':
                    int k=(int)s.size();
                    if(k%2){
                        string s1=s.substr(0,k/2),s2=s.substr(k/2,1),s3=s.substr(k/2+1);
                        s=s3+s2+s1;
                    }else{
                        string s1=s.substr(0,k/2),s2=s.substr(k/2);
                        s=s2+s1;
                    }
                    break;
                case 'A':
                    reverse(s.begin(),s.end());
                case 'P':
                    for(auto c:s){
                        if('1'<=c && c<='9')c--;
                        if(c=='0')c+=9;
                    }
                    break;
                case 'M':
                    for(auto c:s){
                        if('0'<=c && c<='8')c++;
                        if(c=='9')c-=9;
                    }
                    break;
            }
        }
        cout<<s<<endl;
    }
}

C++: #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>

#define el endl
#define fd fixed
#define INF INT_MAX/2-1
#define pb push_back

using namespace std;

string num = "0123456789";

string mrj(string s) {
  return s[s.length()-1] + s.substr(0, s.length()-1);
}

string missc(string s) {
  return s.substr(1, s.length()-1) + s[0];
}

string mre(string s) {
  if (s.length() % 2 == 1) return s.substr(s.length()/2+1, s.length()/2) + s[s.length()/2] + s.substr(0, s.length()/2);
  else return s.substr(s.length()/2, s.length()/2) + s.substr(0, s.length()/2);
}

string mra(string s) {
  string res = "";
  for (int i = s.length()-1; i >= 0; i--) {
    res += s[i];
  }
  return res;
}

string drp(string s) {
  for (int i = 0; i < s.length(); i++) {
    int index = (int)num.find(s[i]);
    if (index > 0) {
      s[i] = num[(index+9)%10];
    }
  }
  return s;
}

string mrm(string s) {
  for (int i = 0; i < s.length(); i++) {
    int index = (int)num.find(s[i]);
    if (index > 0) {
      s[i] = num[(index+1)%10];
    }
  }
  return s;
}

int main() {
  int n;
  string order, message;
  cin >> n;
  while (n--) {
    cin >> order >> message;
    for (int i = order.length()-1; i >= 0; i--) {
      if (order[i] == 'J') message = mrj(message);
      if (order[i] == 'C') message = missc(message);
      if (order[i] == 'E') message = mre(message);
      if (order[i] == 'A') message = mra(message);
      if (order[i] == 'P') message = drp(message);
      if (order[i] == 'M') message = mrm(message);
    }
    cout << message << el;
  }
}

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

#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define DEB 0
#define all(x) x.begin(), x.end()

int main(){
  int n;
  string order, mess, tmp;
  cin>>n;
  while(n--){
    cin >> order >> mess;
    for(int i=order.size()-1; i>=0; i--){
      switch(order[i]){
      case 'C':
	mess = mess.substr(1) + mess.substr(0,1);
	break;
      case 'J':
	mess = mess.substr(mess.size()-1) + mess.substr(0,mess.size()-1);
	break;
      case 'E':
	tmp = "";
	for(int j=mess.size()/2; j<mess.size(); j++){
	  tmp += mess[j];
	}
	rep(j,mess.size()/2){
	  tmp += mess[j];
	}
#if DEB
	cout << "tmp:" << tmp << endl;
#endif
	mess = tmp;
	break;
      case 'A':
	reverse(all(mess));
	break;
      case 'P':
	rep(j,mess.size()){
	  if( '0'<=mess[j] && mess[j]<='9' ){
	    if( mess[j]=='0' ){
	      mess[j] = '9';
	    }else{
	      mess[j]--;
	    }
	  }
	}
	break;
      case 'M':
	rep(j,mess.size()){
	  if( '0'<=mess[j] && mess[j]<='9' ){
	    if( mess[j]=='9' ){
	      mess[j] = '0';
	    }else{
	      mess[j]++;
	    }
	  }
	}
	break;
      }
#if DEB
      cout << ":: " << mess << endl;
#endif
    }
    cout << mess << endl;
  }
  return 0;
}