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 <string>
#include <stdio.h>
#include <cstdio>
#include <algorithm>
using namespace std;

int main(){
    int n;
    cin >> n;
    while( n-- ){
        string p, m;
        cin >> p >> m;
        reverse( p.begin(), p.end() );
        for( size_t i = 0; i < p.length(); i++ ){
            switch(p[i]){
                case 'J':{
                    char tmp = m[m.length() - 1];
                    for( size_t j = m.length() - 1; j > 0; j-- ){
                        //if( j == 0 ){
                        //}else{
                            m[j] = m[j-1];
                        //}
                        //cout << m[j] << endl;
                    }
                    m[0] = tmp;
                    break;
                }case 'C':{
                    char tmp = m[0];
                    for( size_t j = 0; j < m.length(); j++ ){
                        if( j == m.length() - 1 ) m[j] = tmp;
                        else m[j] = m[j+1];
                    }
                    break;
                }case 'E':{
                    string tmp = m.substr( 0, m.length() / 2 );
                    m = m.substr( (m.length() + 1) / 2 );
                    m.append( tmp );
                    break;
                }case 'A':{
                    reverse( m.begin(), m.end() );
                    break;
                }case 'P':{
                    for( size_t j = 0; j < m.length(); j++ ){
                        if( '1' <= m[j] && m[j] <= '9' ){
                            m[j]--;
                        }else if( '0' == m[j] ){
                            m[j] = '9';
                        }
                    }
                    break;
                }case 'M':{
                    for( size_t j = 0; j < m.length(); j++ ){
                        if( '0' <= m[j] && m[j] <= '8' ){
                            m[j]++;
                        }else if( '9' == m[j] ){
                            m[j] = '0';
                        }
                    }
                    break;
                }
            }
        }
        cout << m << endl;
    }
}

C++: #include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)

using namespace std;

int main(){ _;
  int n;
  string oom, mkg;
  cin>>n;
  REP(z,n){
    cin>>oom>>mkg;
    for(int j=oom.size()-1;j>=0;j--){
      char p=oom[j];
      switch(p){
      case 'J':
	for(int i=(int)mkg.size()-2;i>=0;i--)
	  swap(mkg[i],mkg[i+1]);
	break;
      case 'C':
	for(int i=0;i<=(int)mkg.size()-2;i++)
	  swap(mkg[i],mkg[i+1]);
	break;
      case 'E':{
	int offset=mkg.size()-mkg.size()/2;
	for(int i=0;i<(int)mkg.size()/2;i++)
	  swap(mkg[i],mkg[i+offset]);
	break;
      }
      case 'A':
	for(int i=0;i<(int)mkg.size()/2;i++)
	  swap(mkg[i],mkg[mkg.size()-1-i]);
	break;
      case 'P':
	for(char& c:mkg)
	  if(c>='1'&&c<='9') c--;
	  else if(c=='0') c='9';
	break;
      case 'M':
	for(char& c:mkg)
	  if(c>='0'&&c<='8') c++;
	  else if(c=='9') c='0';
	break;
      }
    }
    cout<<mkg<<endl;
  }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back 
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

string func2(char people,string str){
	string newstr;
	if(people=='J'){
		newstr+=str[str.size()-1];
		FOR(i,0,str.size()-1){
			newstr += str[i];
		}
	}
	if(people=='C'){
		FOR(i,1,str.size()){
			newstr += str[i];
		}
		newstr+=str[0];
	}
	if(people=='E'){
		if(str.size()%2==1){
			FOR(i,str.size()/2+1,str.size()){
				newstr += str[i];
			}
			newstr += str[(str.size()-1)/2];
			FOR(i,0,str.size()/2){
				newstr += str[i];
			}
		}else{
			FOR(i,str.size()/2,str.size()){
				newstr += str[i];
			}
			FOR(i,0,str.size()/2){
				newstr += str[i];
			}			
		}
	}
	if(people=='A'){
		FOR(i,0,str.size()){
			newstr += str[str.size()-i-1];
		}
	}
	if(people=='M'){
		FOR(i,0,str.size()){
			if(('0'<= str[i])&&(str[i]<='9')){
				if(str[i]!='9') newstr += (str[i]+1);
				else newstr += '0';
			}else{
				newstr += str[i];
			}
		}
	}
	if(people=='P'){
		FOR(i,0,str.size()){
			if(('0'<= str[i])&&(str[i]<='9')){
				if(str[i]!='0') newstr += (str[i]-1);
				else newstr += '9';
			}else{
				newstr += str[i];
			}
		}
	}
	return newstr;
}
int main(){
	int n;
	cin >> n;
	REP(i,n){
		string plist,str;
		cin >> plist >> str;
		FOR(j,0,plist.size()){
			char pp = plist[plist.size()-1-j];
			str = func2(pp,str);
		}
		cout << str << endl;
	}
}