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 <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

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

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

string invstr(string s) {
    if(s.length() % 2) {
        int k = s.length() / 2;
        string s1, s2;
        s1 = s.substr(0,k);
        s2 = s.substr(k+1,k);
        s = s2 + s[k] + s1;
    }
    else {
        int k = s.length() / 2;
        string s1, s2;
        s1 = s.substr(0,k);
        s2 = s.substr(k,k);
        s = s2 + s1;
    }
    return s;
}
string incdigit(string s) {
    rep(i,0,s.length()) {
        if('0' <= s[i] && s[i] <= '9') {
            int k = s[i] - '0';
            k = (k + 1) % 10;
            s[i] = (char)((int)'0' + k);
        }
    }
    return s;
}
string decdigit(string s) {
    rep(i,0,s.length()) {
        if('0' <= s[i] && s[i] <= '9') {
            int k = s[i] - '0';
            k = (k - 1 + 10) % 10;
            s[i] = (char)((int)'0' + k);
        }
    }
    return s;
}

signed main() {
    int n; cin >> n;
    rep(i,0,n) {
        string op, s;
        cin >> op >> s;
        reverse(op.begin(), op.end());
        rep(j,0,op.length()) {
            if(op[j] == 'C') s = s.substr(1) + s[0];
            if(op[j] == 'J') s = s[ s.length() - 1 ] + s.substr(0,s.length() - 1);
            if(op[j] == 'E') s = invstr(s);
            if(op[j] == 'A') reverse(s.begin(), s.end());
            if(op[j] == 'M') s = incdigit(s);
            if(op[j] == 'P') s = decdigit(s);
        }
        cout << s << endl;
    }
    return 0;
}

C++: #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;

long long int power(long long int x, long long int n, long long int M) {
	long long int tmp = 1;

	if (n > 0) {
		tmp = power(x, n / 2, M);
		if (n % 2 == 0) tmp = (tmp*tmp) % M;
		else tmp = (((tmp*tmp) % M)*x) % M;
	}
	return tmp;
}

long long int N, M, K, Q, W, H, L, R;
long long int ans;



int main() {
	ios::sync_with_stdio(false);
	cin >> N;
	for (int i = 0; i < N; i++) {
		string a, b;
		cin >> a >> b;
		for (auto j = a.rbegin(); j != a.rend(); ++j) {
			if (*j == 'J') {
				char c;
				c = b.back();
				b.pop_back();
				b = c + b;
			}
			if (*j == 'C') {
				char c;
				c = b[0];
				for (int k = 0; k < b.size() - 1; k++) {
					b[k] = b[k + 1];
				}
				b[b.size() - 1] = c;
			}
			if (*j == 'E') {
				string s, t;
				for (int k = 0; k < b.size() / 2; k++) {
					s += b[k];
				}
				for (int k = (b.size() + 1) / 2; k < b.size(); k++) {
					t += b[k];
				}
				for (int k = 0; k < b.size() / 2; k++) {
					b[k] = t[k];
				}
				for (int k = (b.size() + 1) / 2; k < b.size(); k++) {
					b[k] = s[k - (b.size() + 1) / 2];
				}
			}
			if (*j == 'A') {
				for (int k = 0; k < b.size() / 2; k++)swap(b[k], b[b.size() - 1 - k]);
			}
			if (*j == 'M') {
				for (auto k : b) {
					if (k >= '0'&&k <= '9') {
						k=char(k-1);
						if (k == char('0' - 1))k = '9';
					}
				}
			}
			if (*j == 'P') {
				for (auto k : b) {
					if (k >= '0'&&k <= '9') {
						k=char(k+1);
						if (k == char('9' + 1))k = '0';
					}
				}
			}
		}
		cout << b << endl;
	}
	return 0;
}