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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <complex>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <iterator>
#include <unordered_map>

using namespace std;

#define dump(n) cout<<"# "<<#n<<'='<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define iter(c) __typeof__((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();++i)
#define all(c) (c).begin(),(c).end()
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int,int> pii;

const int INFTY=1<<29;
const double EPS=1e-9;

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
	return os<<'('<<p.first<<','<<p.second<<')';
}
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& a){
	os<<'[';
	rep(i,a.size()) os<<(i?" ":"")<<a[i];
	return os<<']';
}

int main()
{
	unordered_map<char,function<string(string)>> inv;
	inv['J']=[](string s){
		rotate(s.begin(),s.end()-1,s.end());
		return s;
	};
	inv['C']=[](string s){
		rotate(s.begin(),s.begin()+1,s.end());
		return s;
	};
	inv['E']=[](string s){
		rep(i,s.size()/2) swap(s[i],s[(s.size()+1)/2+i]);
		return s;
	};
	inv['A']=[](string s){
		return string(s.rbegin(),s.rend());
	};
	inv['P']=[](string s){
		char ds[]="9012345678";
		rep(i,s.size()) if(isdigit(s[i])) s[i]=ds[s[i]-'0'];
		return s;
	};
	inv['M']=[](string s){
		char ds[]="1234567890";
		rep(i,s.size()) if(isdigit(s[i])) s[i]=ds[s[i]-'0'];
		return s;
	};
	
	int tc; cin>>tc;
	while(tc--){
		string m,s; cin>>m>>s;
		reverse(all(m));
		for(char c:m)
			s=inv[c](s);
		cout<<s<<endl;
	}
	
	return 0;
}

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

int main ()
{
    int n;
    cin >> n;
    while (n--) {
        string st, tr;
        cin >> st >> tr;
        for (int i = st.size() - 1; i >= 0; i--) {
            char t;
            switch (st[i])
            {
            case 'J':
            {
                tr = tr[tr.size() - 1] + tr.substr(0, tr.size() - 1);
                break;
            }
            case 'C':
            {
                tr = tr.substr(1, tr.size() - 1) + tr[0];
                break;
            }
            case 'E':
            {
                if (tr.size() % 2) {
                    tr = tr.substr(tr.size() - tr.size() / 2, tr.size() / 2) + tr[tr.size() / 2] + tr.substr(0, tr.size() / 2);
                } else {
                    tr = tr.substr(tr.size() - tr.size() / 2, tr.size() / 2) + tr.substr(0, tr.size() / 2);
                }
                break;
            }
            case 'A':
            {
                string tmp = tr;
                for (int j = 0; j < tr.size(); j++) {
                    tr[j] = tmp[tr.size() - 1 - j];
                }
                break;
            }
            case 'M':
            {
                for (int j = 0; j < tr.size(); j++) {
                    if ('0' <= tr[j] && tr[j] <= '8') {
                        tr[j]++;
                    } else if (tr[j] == '9') {
                        tr[j] = '0';
                    }
                }
                break;
            }
            case 'P':
            {
                for (int j = 0; j < tr.size(); j++) {
                    if ('1' <= tr[j] && tr[j] <= '9') {
                        tr[j]--;
                    } else if (tr[j] == '0') {
                        tr[j] = '9';
                    }
                }
                break;
            }
            default: break;
            }
        }
        cout << tr << endl;
    }

    return 0;
}