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 <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int q;
    cin >> q;
    while(q--){
        string s, t;
        cin >> s >> t;
        int m = t.size();
        reverse(s.begin(),s.end());
        for (auto &&i : s) {
            string tt(t);
            if(i == 'J'){
                for (int j = 0; j < m; ++j) {
                    tt[j] = t[(j+m-1)%m];
                }
            }else if(i == 'C'){
                for (int j = 0; j < m; ++j) {
                    tt[j] = t[(j+1)%m];
                }
            }else if(i == 'E'){
                for (int j = 0; j < m/2; ++j) {
                    tt[j+(m+1)/2] = t[j];
                    tt[j] = t[j+(m+1)/2];
                }
            }else if(i == 'A'){
                reverse(tt.begin(),tt.end());
            }else if(i == 'P') {
                for (int j = 0; j < m; ++j) {
                    if('0' <= tt[j] && tt[j] <= '9'){
                        tt[j] = '0' + (tt[j]-'0'+9)%10;
                    }
                }

            }else {
                for (int j = 0; j < m; ++j) {
                    if('0' <= tt[j] && tt[j] <= '9'){
                        tt[j] = '0' + (tt[j]-'0'+1)%10;
                    }
                }
            }
            t = tt;
        }
        cout << t << "\n";
    }
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cctype>

using namespace std;

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

string revC(string s) {
  return s.substr(1) + s[0];
}

string revE(string s) {
  int n = s.size();
  string ret = s.substr(n/2+(n%2));
  if(n % 2) ret += s[n/2+1];
  ret += s.substr(0, n/2);
  return ret;
}

string revA(string s) {
  reverse(s.begin(), s.end());
  return s;
}

string revP(string s) {
  for(int i=0; i<s.size(); i++)
    if(isdigit(s[i])) s[i] = static_cast<char>(((s[i]-'0') + 9) % 10 + '0');
  return s;
}

string revM(string s) {
  for(int i=0; i<s.size(); i++)
    if(isdigit(s[i])) s[i] = static_cast<char>(((s[i]-'0') + 11) % 10 + '0');
  return s;
}

int main() {
  int n;
  cin >> n;
  
  while(n--) {
    string cmd, s;
    cin >> cmd >> s;
    reverse(cmd.begin(), cmd.end());
    int Ncmd = cmd.size();
    for(int i=0; i<Ncmd; i++) {
      switch(cmd[i]) {
      case 'A': s = revA(s); break;
      case 'C': s = revC(s); break;
      case 'E': s = revE(s); break;
      case 'J': s = revJ(s); break;
      case 'M': s = revM(s); break;
      case 'P': s = revP(s); break;
      }
    }
    cout << s << endl;
  }
  
  return 0;
}

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

string str;

void C(int len){
    char tmp = str[0];
    for(int i = 1 ; i < len; i++){
        str[i-1] = str[i];
    }
    str[len-1] = tmp;
}

void J(int len){
    char tmp = str[len-1];
    for(int i = len-2; i >=0 ; i--){
        str[i+1] = str[i];
    }
    str[0] = tmp;
}

void E(int len){
    int div = len/2;
    
    if(len%2==0){
        string f = str.substr(0,div) , g = str.substr(div,len-1);
        str = "";
        str += g+f;
    }
    else{
        string f = str.substr(0,div), g = str.substr(div+1,len);
        string mid = str.substr(div,1);
        str = "";
        str += g+mid+f;
    }
}

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

void M(int len){
    for(int i = 0 ; i < len ; i++){
        if('0' <= str[i] && str[i] <= '8'){
            str[i] += 1;
        }
        else if(str[i] == '9') str[i] = '0';
    }
}

void P(int len){
    for(int i = 0 ; i < len ; i++){
        if('1' <= str[i] && str[i] <= '9'){
            str[i] -= 1;
        }
        else if(str[i] == '0') str[i] = '9';
    }
}

int main(){
    int n;
    cin >> n;
    while(n--){
        string order;
        cin >> order >> str;
        
        int len = str.size();
        reverse(order.begin(),order.end());
        
        for(int i = 0 ; i < order.size() ; i++){
            switch(order[i]){
                    case 'J':
                    J(len);
                    break;
                    
                    case 'C':
                    C(len);
                    break;
                    
                    case 'E':
                    E(len);
                    break;
                    
                    case 'A':
                    A();
                    break;
                    
                    case 'M':
                    M(len);
                    break;
                    
                    case 'P':
                    P(len);
                    break;
            }
        }
        cout << str << endl;
    }
    return 0;
}