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 rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;

string s, t;

void j() {
    char c = t[0];
    for (int i=1; i<t.size(); ++i) {
        t[i-1] = t[i];
    }
    t[t.size()-1] = c;
}

void c() {
    char c = t[t.size()-1];
    for (int i=t.size()-2; i>=0; --i) {
        t[i+1] = t[i];
    }
    t[0] = c;
}

void a() {
    reverse(t.begin(), t.end());
}

void e() {
    if (t.size()%2) {
        char c = t[t.size()/2];
        string a = t.substr(0, t.size()/2), b = t.substr(t.size()/2+1, t.size()/2);
        t = b + c + a;
    }
    else {
        string a = t.substr(0, t.size()/2), b = t.substr(t.size()/2, t.size()/2);
        t = b + a;
    }
}

void p() {
    rep(i, t.size()) {
        if (t[i] == '9') t[i] = '0';
        else if ('0' <= t[i] and t[i] <= '9') t[i]++;
    }
}

void m() {
    rep(i, t.size()) {
        if (t[i] == '0') t[i] = '9';
        else if ('0' <= t[i] and t[i] <= '9') t[i]--;
    }
}

int main() {
    int n;
    cin >> n;

    rep(i, n) {

        cin >> s >> t;

        reverse(s.begin(), s.end());
        rep(i, s.size()) {
            switch(s[i]) {
                case 'A': a(); break;
                case 'J': c(); break;
                case 'C': j(); break;
                case 'P': m(); break;
                case 'M': p(); break;
                case 'E': e(); break;
            }
        }

        cout << t << endl;

    }
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>

using namespace std;

string c_j(string str);
string c_c(string str);
string c_e(string str);
string c_a(string str);
string c_p(string str);
string c_m(string str);

int main()
{
	int n;
	string order, message;
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> order >> message;
		string ans = message;
		for(int j = order.length()-1; j >= 0; j--){
			if(order[j] == 'J') ans = c_j(ans);
			else if(order[j] == 'C') ans = c_c(ans);
			else if(order[j] == 'E') ans = c_e(ans);
			else if(order[j] == 'A') ans = c_a(ans);
			else if(order[j] == 'P') ans = c_p(ans);
			else if(order[j] == 'M') ans = c_m(ans); 
		}
		cout << ans << endl;
	}
	return 0;
}

string c_j(string str)
{
	char c;
	c = str[str.length()-1];
	str.erase(str.end()-1);
	str = c + str;
	return str;
}

string c_c(string str)
{
	char c;
	c = str[0];
	str.erase(str.begin());
	str += c;
	return str;
}

string c_e(string str)
{
	string a;
	int l = str.length();
	a = str.substr(0, l / 2);
	if( l % 2 == 1){
		char c = str[l / 2 + 1];
		str.erase(str.begin(), str.begin() + l);
		str += c;
		str += a;
	} else {
		str.erase(str.begin(), str.begin() + (l - 1));
		str += a;
	}
	return str;
}

string c_a(string str)
{
	reverse(str.begin(), str.end());
	return str;
}

string c_p(string str)
{
	for(int i = 0; i < str.length() - 1; i++){
		if(isdigit(str[i])){
			int n = str[i] - '0';
			n--;
			if(n == -1) n = 9;
			str[i] = n + '0';
		}
	}
	return str;
}

string c_m(string str)
{
	for(int i = 0; i < str.length() - 1; i++){
		if(isdigit(str[i])){
			int n = str[i] - '0';
			n = (n + 1) % 10;
			str[i] = n + '0';
		}
	}
	return str;
}

C++: #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;

//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
string MrJ(string s) { return s.substr(1) + s.front(); }
string MissC(string s) { return s.back() + s.substr(0, s.size() - 1); }
string MrE(string s) {
	string res;
	if (s.size() % 2) {
		res = s[s.size() / 2];
		res += s.substr(0, s.size() / 2);
		res = s.substr(s.size() / 2 + 1)+res;
	}
	else {
		res = s.substr(s.size() / 2) + s.substr(0, s.size() / 2);
	}
	return res;
}
string MrA(string s) { string res = s; reverse(res.begin(), res.end()); return res; }
string DrP(string s) {
	rep(i, 0, s.size()) {
		if (isdigit(s[i])) {
			if (s[i] == '9')s[i] = '0';
			else s[i]++;
		}
	}
	return s;
}
string MrM(string s) {
	rep(i, 0, s.size()) {
		if (isdigit(s[i])) {
			if (s[i] == '0')s[i] = '9';
			else s[i]--;
		}
	}
	return s;
}
signed main() {
	int n; cin >> n;
	while (n--) {
		string order, king;
		cin >> order >> king;
		rrep(i, 0, order.size()) {
			switch (order[i])
			{
			case 'J':king = MissC(king); break;
			case 'C':king = MrJ(king); break;
			case 'E':king = MrE(king); break;
			case 'A':king = MrA(king); break;
			case 'P':king = MrM(king); break;
			case 'M':king = DrP(king); break;
			default:
				break;
			}
		}

		cout << king << endl;
	}
	return 0;
}