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;

string J(string str) {
  string a;
  a+= str[str.size()-1];
  for(int i=0;i<str.size()-1;i++) a += str[i];
  return a;
}

string C(string str){
  string a;
  for(int i=1;i<str.size();i++) a+=str[i];
  a += str[0];
  return a;
}

string E(string str) {
  string a = str;
  for(int i=0;i<str.size()/2;i++) 
    a[i] = str[str.size()-str.size()/2+i],a[str.size()-str.size()/2+i]=str[i];
  return a;
}

string P(string str){
  for(int i=0;i<str.size();i++) 
    if('0' <= str[i] && str[i] <= '9') str[i] = (str[i]-'0'-1+10)%10+'0';
  return str;
}

string M(string str){
  for(int i=0;i<str.size();i++) 
    if('0' <= str[i] && str[i] <= '9') str[i] = (str[i]-'0'+1)%10+'0';
  return str;
} 

int main() {
  int n;
  cin >>n;
  for(int q=0;q<n;q++) {
    string order;
    cin >> order;
    reverse(order.begin(),order.end());
    string str;
    cin >> str;
    for(int i=0;i<order.size();i++){
      if(order[i] == 'J') str = J(str);
      else if(order[i] == 'C') str=C(str);
      else if(order[i] == 'E') str = E(str);
      else if(order[i] == 'A') reverse(str.begin(),str.end());
      else if(order[i] == 'P') str = P(str);
      else if(order[i] == 'M') str = M(str);
    }
    cout << str << endl;
  }

  return 0;
}

C++: #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
const int INF = 100000000;
using namespace std;

int main(){
    int n;
    cin >> n;
    rep(i,n){
        list<char> li;
        list<char>::iterator it;
        string order, s, temp;
        cin >> temp >> s;
        rep(j,s.size()) li.emplace_back(s[j]);
        for(int j = temp.size() - 1; j >= 0; j--) order += temp[j];
        rep(j,order.size()){
            if(order[j] == 'C'){
                li.emplace_back(*li.begin());
                li.pop_front();
            }else if(order[j] == 'J'){
                li.emplace_front(*(--li.end()));
                li.pop_back();
            }else if(order[j] == 'E'){
                int m = li.size();
                rep(k, m / 2){
                    li.emplace_back(*li.begin());
                    li.pop_front();
                }
                if(m % 2){
                    it = li.begin();
                    rep(k, m / 2 + 1) *it++;
                    li.insert(it, *li.begin());
                    li.pop_front();
                }
            }else if(order[j] == 'A'){
                li.reverse();
            }else if(order[j] == 'M'){
                for(it = li.begin(); it != li.end(); it++){
                    if(*it >= '0' && *it <= '8') *it = *it + 1;
                    else if(*it == '9') *it = '0';
                }
            }else if(order[j] == 'P'){
                for(it = li.begin(); it != li.end(); it++){
                    if(*it >= '1' && *it <= '9') *it = *it - 1;
                    else if(*it == '0') *it = '9';
                }
            }
        }
        for(auto t: li){
            cout << t;
        }
        cout << endl;
    }
}

C++: #include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<int, lint> pil;
typedef pair<lint, lint> pll;
template<class T>bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T>bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod*mod;
constexpr int MAX = 100010;

int main(){
    int q;
    scanf("%d", &q);
    auto f = [](string s, char c){
        int K = s.size();
        string t;
        if(c == 'J') t = s[K-1] + s.substr(0, K-1);
        if(c == 'C') t = s.substr(1) + s[0];
        if(c == 'E'){
            if(K%2 == 0) t = s.substr(K/2) + s.substr(0, K/2);
            else t = s.substr((K+1)/2) + s[K/2] + s.substr(0, K/2);
        }
        if(c == 'A'){
            reverse(s.begin(), s.end());
            t = s;
        }
        if(c == 'P'){
            t = s;
            for(auto &i: t)if(isdigit(i)) i = (i-48-1+10)%10 + 48;
        }
        if(c == 'M'){
            t = s;
            for(auto &i: t)if(isdigit(i)) i = (i-48+1)%10 + 48;
        }
        return t;
    };
    while(q--){
        string t, s;
        cin >> t >> s;
        reverse(t.begin(), t.end());
        for(auto c: t) s = f(s, c);
        cout << s << "\n";
    }
}