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>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;

int main() {
	int n;
	while (~scanf("%d", &n)) {
		rep(i, n) {
			string m, s; cin >> m >> s;
			reverse(m.begin(), m.end());
			for (char c : m) {
				switch (c) {
				case'C':rotate(s.begin(), ++s.begin(), s.end()); break;
				case'J':rotate(s.begin(), --s.end(), s.end()); break;
				case'E':s = s.substr(s.size() / 2 + s.size() % 2) + s.substr(s.size() / 2, s.size() % 2) + s.substr(0, s.size() / 2); break;
				case'A':reverse(s.begin(), s.end()); break;
				case'M':transform(s.begin(), s.end(), s.begin(), [](char c) {
					if (c == '9')return'0';
					if ('0' <= c&&c < '9')return ++c;
				}); break;
				case'P':transform(s.begin(), s.end(), s.begin(), [](char c) {
					if (c == '0')return'9';
					if ('0' < c&&c <= '9')return --c;
				}); break;
				}
			}
			cout << s << endl;
		}
	}
}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
//constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

string J(string s) {
	if (s.size() == 1) return s;
	string res = s.substr(1, s.size());
	res += s[0];
	return res;
}

string C(string s) {
	if (s.size() == 1) return s;
	string res;
	res += s.back();
	res += s.substr(0, (int)s.size() - 1);
	return res;
}

string E(string s) {
	string res;
	res += s.substr((s.size() + 1) / 2, s.size());
	if (s.size() % 2 == 1) res += s[s.size() / 2];
	res += s.substr(0, (s.size()) / 2);
	return res;
}

string A(string s) {
	string res = s;
	reverse(res.begin(), res.end());
	return res;
}

string P(string s) {
	string res = s;
	for (int i = 0; i < s.size(); i++) {
		if (res[i] >= '0' && res[i] <= '8') {
			res[i]++;
		}
		else if (res[i] == '9') res[i] = '0';
	}
	return res;
}

string M(string s) {
	string res = s;
	for (int i = 0; i < s.size(); i++) {
		if (res[i] >= '1' && res[i] <= '9') {
			res[i]--;
		}
		else if (res[i] == '0') res[i] = '9';
	}
	return res;
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	int kkt; scanf("%d", &kkt);
	while (kkt--) {
		string t, s; cin >> t >> s;
		reverse(t.begin(), t.end());
		for (int i = 0; i < t.size(); i++) {
			if (t[i] == 'J') s = C(s);
			if (t[i] == 'C') s = J(s);
			if (t[i] == 'E') s = E(s);
			if (t[i] == 'A') s = A(s);
			if (t[i] == 'P') s = M(s);
			if (t[i] == 'M') s = P(s);
		}
		cout << s << "\n";
	}
	return 0;

}