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 <cctype>
#include <string>
using namespace std;
 
string oom, mes;
 
 
void rJ() {
  const string tmp = mes;
  mes = tmp[tmp.length()-1] + tmp.substr(0, tmp.length()-1);
}
void rC() {
  const string tmp = mes;
  mes = tmp.substr(1) + tmp[0];
}
void rE() {
  string l = mes.substr(0, mes.length()/2);
  string r = mes.substr((mes.length()+1)/2);
  if(mes.length() % 2 != 0) {
    mes = r + mes[mes.length()/2] + l;
  } else {
    mes = r + l;
  }
}
void rA() {
  reverse(mes.begin(), mes.end());
}
 
void rP() {
  for(int i = 0; i < mes.length(); ++i) {
    if(isdigit(mes[i])) {
      mes[i] = (mes[i]-'0'+9)%10+'0';
    }
  }
}
void rM() {
  for(int i = 0; i < mes.length(); ++i) {
    if(isdigit(mes[i])) {
      mes[i] = (mes[i]-'0'+1)%10+'0';
    }
  }
}
 
void solve() {
  reverse(oom.begin(), oom.end());
  for(int i = 0; i < oom.length(); ++i) {
    switch(oom[i]) {
    case 'J': rJ(); break;
    case 'C': rC(); break;
    case 'E': rE(); break;
    case 'A': rA(); break;
    case 'P': rP(); break;
    case 'M': rM(); break;
    }
  }
  cout << mes << endl;
}
 
main() {
  int n;
  cin >> n;
  for(int i = 0; i < n; ++i) {
    cin >> oom;
    cin >> mes;
    solve();
  }
}

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

#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;

int main() {
	int n;
	cin >> n;
	while(n--) {
		string order, message;
		cin >> order >> message;
		for(int i=order.length()-1; i>=0; i--) {
			switch(order[i]) {
				case 'J':
					message = message[message.length()-1] + message.substr(0,message.length()-1);
					break;
				case 'C':
					message = message.substr(1,message.length()-1) + message[0];
					break;
				case 'E':
					if(message.length()%2) {
						message = message.substr(message.length()/2+1,message.length()/2) + message[message.length()/2] + message.substr(0,message.length()/2);
					} else {
						message = message.substr(message.length()/2,message.length()/2) + message.substr(0,message.length()/2);
					}
					break;
				case 'A':
					reverse(message.begin(), message.end());
					break;
				case 'P':
					for(int i=0; i<message.length(); i++) {
						if('0'<=message[i] && message[i]<='9') {
							message[i] = ((message[i]-'0'+9)%10)+'0';
						}
					}
					break;
				case 'M':
					for(int i=0; i<message.length(); i++) {
						if('0'<=message[i] && message[i]<='9') {
							message[i] = ((message[i]-'0'+1)%10)+'0';
						}
					}
					break;
			}
		}
		cout << message << endl;
	}
	return 0;
}