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,l;
  string o,k;
  cin>>n;
  while(n--){
    cin>>o>>k;
    int l=k.size();
    for(int i=o.size()-1;i>=0;i--){
      if(o[i]=='J')
	k=k[l-1]+k.substr(0,l-1);
      else if(o[i]=='C')
	k=k.substr(1,l-1)+k[0];
      else if(o[i]=='E'){
	if(l%2)
	  k=k.substr(l/2+1)+k[l/2]+k.substr(0,l/2);
	else
	  k=k.substr(l/2)+k.substr(0,l/2);
      }
      else if(o[i]=='A')
	reverse(k.begin(),k.end());
      else if(o[i]=='P'){
	for(int j=0;j<l;j++){
	  if('1'<=k[j]&&k[j]<='9')
	    k[j]--;
	  else if(k[j]=='0')
	    k[j]='9';
	}
      }
      else if(o[i]=='M'){
	for(int j=0;j<l;j++){
	  if('0'<=k[j]&&k[j]<='8')
	    k[j]++;
	  else if(k[j]=='9')
	    k[j]='0';
	}
      }
    }
    cout<<k<<endl;
  }
  return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>

using namespace std;

void c_j(string str);
void c_c(string str);
void c_e(string str);
void c_a(string str);
void c_p(string str);
void c_m(string str);

int main()
{
	int n;
	string order, message;
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> order >> message;
		for(int j = order.length()-1; j >= 0; j++){
			if(order[j] == 'J') c_j(message);
			else if(order[j] == 'C') c_c(message);
			else if(order[j] == 'E') c_e(message);
			else if(order[j] == 'A') c_a(message);
			else if(order[j] == 'P') c_p(message);
			else if(order[j] == 'M') c_m(message); 
		}
		cout << message << endl;
	}
	return 0;
}

void c_j(string str)
{
	char c;
	c = str[str.length()-1];
	str.pop_back();
	str = c + str;
}

void c_c(string str)
{
	char c;
	c = str[0];
	str.erase(str.begin());
	str += c;
}

void c_e(string str)
{
	string a;
	int l = str.length();
	a = str.substr(0, l / 2);
	if( l % 2 == 1){
		char c = str[l / 2 + 1];
		str.erase(str.begin(), str.begin() + l);
		str += c;
		str += a;
	} else {
		str.erase(str.begin(), str.begin() + (l - 1));
		str += a;
	}
}

void c_a(string str)
{
	reverse(str.begin(), str.end());
}

void c_p(string str)
{
	for(int i = 0; i < str.length() - 1; i++){
		if(isdigit(str[i])){
			int n = str[i] - '0';
			n--;
			if(n == -1) n = 9;
			str[i] = n + '0';
		}
	}
}

void c_m(string str)
{
	for(int i = 0; i < str.length() - 1; i++){
		if(isdigit(str[i])){
			int n = str[i] - '0';
			n = (n + 1) % 10;
			str[i] = n + '0';
		}
	}
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;
typedef long long ll;

int main() {
    int n;
    cin >> n;

    rep(i,n) {
        string a,b;
        cin >> a >> b;

        for(int j=a.size()-1;j>=0;j--) {
            if(a[j] == 'J') {
                rotate(b.rbegin(),b.rbegin()+1,b.rend());
            }
            if(a[j] == 'C') {
                rotate(b.begin(),b.begin()+1,b.end());
            }
            if(a[j] == 'E') {
                stringstream ss;

                if(b.size()%2 == 0) {
                    REP(k,b.size()/2,b.size()) {
                        ss << b[k];
                    }
                    rep(k,b.size()/2) {
                        ss << b[k];
                    }
                }
                else {
                    REP(k,b.size()/2+1,b.size()) {
                        ss << b[k];
                    }

                    ss << b[b.size()/2];

                    rep(k,b.size()/2) {
                        ss << b[k];
                    }
                }

                b = ss.str();
            }
            if(a[j] == 'A') {
                reverse(b.begin(),b.end());
            }
            if(a[j] == 'P') {
                rep(k,b.size()) {
                    if(b[k] == '0') b[k] = '9';
                    else if('1' <= b[k] && b[k] <= '9') b[k]--;
                }
            }
            if(a[j] == 'M') {
                rep(k,b.size()) {
                    if(b[k] == '9') b[k] = '0';
                    else if('0' <= b[k] && b[k] <= '8') b[k]++;
                }
            }
        }

        cout << b << endl;

    }

    return 0;
}