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 <cctype>
#include <iostream>
#include <string>
using namespace std;

void solve() {
	string order, message;
	cin >> order >> message;
	for (int i = order.size() - 1; i >= 0; i--) {
		switch (order[i]) {
		case 'J':
			if (message.size() >= 2) {
				message = (*message.rbegin()) + message.substr(0, message.size() - 1);
			}
			break;
		case 'C':
			if (message.size() >= 2) {
				message = message.substr(1) + message[0];
			}
			break;
		case 'E':
			if (message.size() >= 2) {
				int pos = message.size() / 2;
				message = message.substr(pos) + message.substr(0, pos);
			}
			break;
		case 'A':
			message = string(message.rbegin(), message.rend());
			break;
		case 'P':
			for (unsigned j = 0; j < message.size(); j++) {
				if (isdigit(message[j])) {
					if (message[j] == '0') {
						message[j] = '9';
					}
					else {
						message[j]--;
					}
				}
			}
			break;
		case 'M':
			for (unsigned j = 0; j < message.size(); j++) {
				if (isdigit(message[j])) {
					if (message[j] == '9') {
						message[j] = '0';
					}
					else {
						message[j]++;
					}
				}
			}
			break;
		}
	}
	cout << message << endl;
}

int main () {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		solve();
	}
	return 0;
}

C++: #include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(i, (v).size()) { cout << v[i]; if (i != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///
char next(char c) {
	if (isdigit(c)) {
		if (c == '9')return '0';
		else return c + 1;
	}
	return c;
}
char form(char c) {
	if (isdigit(c)) {
		if (c == '0')return '9';
		return c - 1;
	}
	return c;
}
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	REP(j, n) {
		string v, s;
		cin >> v >> s;
		reverse(ALL(v));
		REP(i, v.size()) {
			if (v[i] == 'C') {
				char c = s[0];
				REP(k, s.size() - 1) {
					s[k] = s[k + 1];
				}
				s[s.size() - 1] = c;
			}
			else if (v[i] == 'J') {
				char c = s[s.size() - 1];
				RREP(k, s.size() - 1) {
					s[k + 1] = s[k];
				}
				s[0] = c;
			}
			else if (v[i] == 'E') {
				int c = s.size() / 2;
				string tmp = s.substr(0, c);
				REP(k, c) {
					s[k] = s[s.size() - c + k];
				}
				REP(k, c) {
					s[s.size() - c + k] = tmp[k];
				}
			}
			else if (v[i] == 'A') {
				REP(k, s.size() / 2) {
					swap(s[k], s[s.size() - 1 - k]);
				}
			}
			else if (v[i] == 'P') {
				REP(k, s.size()) {
					s[k] = form(s[k]);
				}
			}
			else if (v[i] == 'M') {
				REP(k, s.size()) {
					s[k] = next(s[k]);
				}
			}
		}

		cout << s << endl;

	}
}