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<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
 
using namespace std;
 
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
 
typedef vector<int> vi;
typedef pair<int,int> pii;
 
int main(void) {
  int i,j,k;
  int n;
  cin>>n;
  rep(i,n){
    string ord,s;
    cin>>ord;
    cin>>s;
    int len=s.size();
    for(j=ord.size()-1;j>=0;j--){
      if(ord[j]=='C'){
    string tmp="";
    tmp.push_back(s[0]);
    s.erase(s.begin());
    s+=tmp;
      }else if(ord[j]=='J'){
    string tmp="";
    tmp.push_back(s[len-1]);
    s.erase(s.end()-1);
    s=tmp+s;
      }else if(ord[j]=='A'){
    reverse(all(s));
      }else if(ord[j]=='E'){
    rep(k,len/2)
      swap(s[k],s[(len+1)/2+k]);
      }else if(ord[j]=='M'){
    rep(k,len)
      if(s[k]<='8' && s[k]>='0')s[k]++;
      else if(s[k]=='9')s[k]='0';
      }else{
    rep(k,len)
      if(s[k]<='9' && s[k]>'0')s[k]--;
      else if(s[k]=='0')s[k]='9';
      }
    }
    cout<<s<<endl;
  }
}

C++: #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
#include <stack>
#include <tuple>
using namespace std;
#define rep(i,n) for (int i=0; i < (n); i++)


typedef long long int ll;
typedef double D;      // ??§?¨?????????????double???long double?????????
typedef complex<D> P;  // Point
typedef pair<P, P> L;  // Line
typedef vector<P> VP;


const int INF = (1<<30) - 1;
const D EPS = 1e-9;

#define X real()
#define Y imag()
#define LE(n,m) ((n) < (m) + EPS)
#define GE(n,m) ((n) + EPS > (m))
#define EQ(n,m) (abs((n)-(m)) < EPS)

map<char, string(*)(string)> functions;


string rev_J(string s){
    string t = "";
    for(int i=0; i<s.size(); i++)
        t += s[(i+s.size()-1)%s.size()];
    return t;
}

string rev_C(string s){
    string t = "";
    for(int i=0; i<s.size(); i++)
        t += s[(i+1)%s.size()];
    return t;
}

string rev_E(string s){
    int n = s.size();
    for(int i=0; i<n/2; i++){
        swap(s[i], s[i+(n+1)/2]);
    }
    return s;
}

string rev_A(string s){
    reverse(s.begin(), s.end());
    return s;
}

string rev_P(string s){
    for(int i=0; i<s.size(); i++){
        char &c = s[i];
        if('0'<=c && c<='9'){
            c = (c-'0'-1+10)%10 + '0';
        }
    }
    return s;
}

string rev_M(string s){
    for(int i=0; i<s.size(); i++){
        char &c = s[i];
        if('0'<=c && c<='9'){
            c = (c-'0'+1)%10 + '0';
        }
    }
    return s;
}

void solve(){
    string members, message;
    cin >> members >> message;
    
    for(int i=members.size()-1; i>=0; i--){
        message = functions[members[i]](message);
    }
    cout << message << endl;
}


//g++ -std=c++0x -msse4.2 -O3
//#include <bits/stdc++.h>
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    functions['A'] = rev_A;
    functions['J'] = rev_J;
    functions['C'] = rev_C;
    functions['E'] = rev_E;
    functions['M'] = rev_M;
    functions['P'] = rev_P;
    
    int T; cin >> T;
    while(T--){
        solve();
    }
    
    return 0;
}