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 <bits/stdc++.h>

using namespace std;

#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(a) ((int)(a).size())
#define BIT(x, i) (((x) >> (i)) & 1)
#define SQ(x) ((x) * (x))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

string C(string s) {
    return string(s.begin()+1, s.end()) + string(s.begin(), s.begin()+1);
}

string J(string s) {
    return string(s.end()-1, s.end()) + string(s.begin(), s.end()-1);
}

string E(string s) {
    int n = s.length();
    if (n % 2 == 0) {
        return string(s.begin()+n/2, s.end()) + string(s.begin(), s.begin()+n/2);
    } else {
        return string(s.begin()+n/2+1, s.end()) + s[n/2] + string(s.begin(), s.begin()+n/2);
    }
}

string A(string s) {
    return string(RALL(s));
}

string M(string s) {
    string str(s);
    REP(i, s.length()) {
        if (isdigit(s[i])) {
            str[i] = '0' + ((s[i] - '0' + 1) % 10);
        }
    }
    return str;
}

string P(string s) {
    string str(s);
    REP(i, s.length()) {
        if (isdigit(s[i])) {
            str[i] = '0' + ((s[i] - '0' - 1 + 10) % 10);
        }
    }
    return str;
}

int main() {
    assert(C("aB23d") == "B23da");
    assert(J("aB23d") == "daB23");
    assert(E("e3ac") == "ace3");
    assert(E("aB23d") == "3d2aB");
    assert(A("aB23d") == "d32Ba");
    assert(M("aB23d") == "aB34d");
    assert(M("e9ac") == "e0ac");
    assert(P("aB23d") == "aB12d");
    assert(P("e0ac") == "e9ac");

    int n;
    cin >> n;
    REP(i, n) {
        string order, s;
        cin >> order >> s;
        RREP(j, order.length()) {
            switch (order[j]) {
            case 'J':
                s = J(s);
                break;
            case 'C':
                s = C(s);
                break;
            case 'E':
                s = E(s);
                break;
            case 'A':
                s = A(s);
                break;
            case 'P':
                s = P(s);
                break;
            case 'M':
                s = M(s);
                break;
            }
        }
        cout << s << endl;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define REPI(i, s, e) for (int i = (s); i <= (e); i++)
#define rep(i, n) REP(i, 0, n)
#define repi(i, n) REPI(i, 0, n)
#define ALL(v) (v).begin(), (v).end()

#define dump(x) (cout << #x << " = " << x << endl)
#define dump2(x, y) (cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl)
#define dump3(x, y, z) (cout << "(" << #x << ", " << #y << ", " << #z << ") = (" << x << ", " << y << ", "<< z << ")" << endl)

typedef long long ll;
typedef pair<int, int> pii;

void j_inverse(string &s)
{
	string buf = s;
	rep(i, s.size())
		buf[i] = s[(s.size()+i-1)%s.size()];
	s = buf;
}

void c_inverse(string &s)
{
	string buf = s;
	rep(i, s.size())
		buf[i] = s[(s.size()+i+1)%s.size()];
	s = buf;
}

void e_inverse(string &s)
{
	string left, right;
	if (s.size()%2==0) {
		left = s.substr(0, s.size()/2);
		right = s.substr(s.size()/2);
		s = right+left;
	} else {
		left = s.substr(0, (s.size()-1)/2);
		right = s.substr((s.size()+1)/2);
		s = right + s[s.size()/2] + left;
	}
}

void a_inverse(string &s)
{
	reverse(ALL(s));
}

void p_inverse(string &s)
{
	rep(i, s.size())
		if (isdigit(s[i]))
			s[i] = (s[i]=='0'?'9':s[i]-1);
}

void m_inverse(string &s)
{
	rep(i, s.size())
		if (isdigit(s[i]))
			s[i] = (s[i]=='9'?'0':s[i]+1);
}

int main(void)
{
	int n;

	cin >> n;
	rep(TTTT, n) {
		string order, str;
		cin >> order >> str;
		rep(i, order.size()) {
			switch(order[order.size()-1-i]) {
			case 'J': j_inverse(str); break;
			case 'C': c_inverse(str); break;
			case 'E': e_inverse(str); break;
			case 'A': a_inverse(str); break;
			case 'P': p_inverse(str); break;
			case 'M': m_inverse(str); break;
			}
		}
		cout << str << endl;
	}
	return 0;
}