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 <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>

// BEGIN CUT HERE
#ifdef _MSC_VER
#include <agents.h>
#endif
// END CUT HERE 

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define MP make_pair
#define MT make_tuple
#define X first
#define Y second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

int main(){
	ios::sync_with_stdio(false);

	int n;
	cin >> n;
	while(n--){
		string ppl, mes;
		cin >> ppl >> mes;

		reverse(ALL(ppl));
		for (auto ch : ppl){
			string nxt;
			int m;
			switch (ch){
			case 'J':
				nxt = mes.back() + mes.substr(0, mes.size() - 1);
				break;
			case 'C':
				nxt = mes.substr(1) + mes[0];
				break;
			case 'E':
				m = mes.size() / 2;
				if (mes.size() & 1){
					nxt = mes.substr(m+1) + mes[m] + mes.substr(0, m);
				}
				else{
					nxt = mes.substr(m) + mes.substr(0, m);
				}
				break;
			case 'A':
				nxt = string(REV(mes));
				break;
			case 'M':
				for (auto c : mes){
					if ('0' <= c && c <= '8') ++c;
					else if (c == '9') c = '0';
					nxt += c;
				}
				break;
			case 'P':
				for (auto c : mes){
					if ('1' <= c && c <= '9') --c;
					else if (c == '0') c = '9';
					nxt += c;
				}
				break;
			}
			mes = nxt;
		}
		cout << mes << endl;
	}


	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#define INF 999999999

int main(){
    int n;
    cin>>n;
    rep(i,n){//JCEAPM
        string member,str;
        cin>>member>>str;
        reverse(all(member));
        rep(i,member.size()){
//            cout<<str<<endl;
            if(member[i] == 'J'){
                str = string(1,str[str.size()-1])+str.substr(0,str.size()-1);
            }else if(member[i] == 'C'){
                str = str.substr(1,str.size()-1)+string(1,str[0]);
            }else if(member[i] == 'E'){
                if(str.size()%2==0){
                    str = str.substr(str.size()/2,str.size()/2)+str.substr(0,str.size()/2);
                }
                else{
                    str = str.substr(str.size()/2+1,str.size()/2)+str[str.size()/2]+str.substr(0,str.size()/2);
                }
            }else if(member[i] == 'A'){
                reverse(all(str));
            }else if(member[i] == 'P'){
                rep(j,str.size()){
                    if(isdigit(str[j])){
                        if(str[j] == '0')str[j] ='9';
                        else str[j]--;
                    }
                }
            }else if(member[i] == 'M'){
                rep(j,str.size()){
                    if(isdigit(str[j])){
                        if(str[j] == '9')str[j] = '0';
                        else str[j]++;
                    }
                }
            }
        }
        cout<<str<<endl;
    }
}

C++: #include <iostream>
#include <string>

using namespace std;

void C(string& str)
{
	string temp;
	for(int i = 1; i < str.size(); ++i)
	{
		temp += str[i];
	}
	temp += str[0];
	str = temp;
}

void J(string& str)
{
	string temp;
	temp += str[str.size() - 1];
	for(int i = 0; i < str.size() - 1; ++i)
	{
		temp += str[i];
	}
	str = temp;
}

void E(string& str)
{
	string temp;
	int n;
	if(str.size() % 2)
	{
		n = str.size() / 2 + 1;
	}
	else
	{
		n = str.size() / 2;
	}
	for(int i = n; i < str.size(); ++i)
	{
		temp += str[i];
	}
	if(str.size() % 2)
	{
		--n;
		temp += str[n];
	}
	for(int i = 0; i < n; ++i)
	{
		temp += str[i];
	}
	str = temp;
}

void A(string& str)
{
	string temp;
	for(int i = str.size() - 1; i >= 0; --i)
	{
		temp += str[i];
	}
	str = temp;
}

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

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

void solve()
{
	int n;
	cin >> n;
	while(n--)
	{
		string command, input;
		cin >> command >> input;
		for(int i = command.size() - 1; i >= 0; --i)
		{
			switch(command[i])
			{
				case 'J':
				  J(input);break;
				case 'C':
				  C(input);break;
				case 'E':
				  E(input);break;
				case 'A':
				  A(input);break;
				case 'P':
				  P(input);break;
				case 'M':
				  M(input);break;
			}
		}
		cout << input << endl;
	}
}

int main()
{
	solve();
	return(0);
}