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;

typedef long long LL;
typedef vector<int>    VI;
typedef vector<bool>   VB;
typedef vector<string> VS;

#define MP make_pair
#define PB push_back
#define ALL(x)  (x).begin(),(x).end()
#define rep(i, N)  for (int i = 0; i < (int)(N); i++)
#define REP(i, init, N)  for (int i = (init); i < (int)(N); i++)
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

int main(void) {
	int n;
	cin >> n;
	rep (i, n) {
		string order, msg;
		cin >> order >> msg;
		reverse(ALL(order));
		rep (j, order.size()) {
			switch (order[j]) {
				case 'J':
					msg = msg[msg.size() - 1] + msg.substr(0, msg.size() - 1);
					break;
				case 'C':
					msg = msg.substr(1) + msg[0];
					break;
				case 'E':
					if (msg.size() % 2) {
						string s1 = msg.substr(0, msg.size() / 2);
						string s2 = msg.substr(msg.size() / 2 + 1);
						msg = s2 + msg[msg.size() / 2] + s1;
					} else {
						string s1 = msg.substr(0, msg.size() / 2);
						string s2 = msg.substr(msg.size() / 2);
						msg = s2 + s1;
					}
					break;
				case 'A':
					reverse(ALL(msg));
					break;
				case 'P':
					for (char &c : msg) {
						if ('0' <= c && c <= '9') {
							c = (c == '0'? '9' : c - 1);
						}
					}
					break;
				case 'M':
					for (char &c : msg) {
						if ('0' <= c && c <= '9') {
							c = (c == '9'? '0' : c + 1);
						}
					}
					break;
				default:
					break;
			}
		}
		cout << msg << endl;
	}

    return 0;
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<cstdlib>
#include<sstream>
#include<queue>
#include<deque>
#include<cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#include<iomanip>
#define INF 2147483647
#define lli long long int
#define MOD 1000000007

using namespace std;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;

int main() {

	int n; cin >> n;
	for (int i = 0 ; i < n; i++) {
		string trans; cin >> trans;
		string org; cin >> org;
		reverse(org.begin(),org.end());
		reverse(trans.begin(),trans.end());

		for (int i = 0; i < trans.size(); i++){
			if (trans[i] == 'J'){
				string str1 = org.substr(0,1);	
				string str2 = org.substr(1,org.size()-1);	
				org = str2 + str1;
			}else if (trans[i] == 'C'){
				string str1 = org.substr(0,org.size()-1);	
				string str2 = org.substr(org.size()-1,1);	
				org = str2 + str1;
			}else if (trans[i] == 'E'){
				if (org.size() % 2 == 0){
					string str1 = org.substr(0,org.size()/2);	
					string str2 = org.substr((org.size()/2),org.size()-(org.size()/2));	
					org = str2 + str1;
				}else{
					string str1 = org.substr(0,org.size()/2);	
					string str2 = org.substr((org.size()/2),1);	
					string str3 = org.substr((org.size()/2)+1,org.size()-(org.size()/2));	
					org = str3 + str2 + str1;
				}

			}else if (trans[i] == 'A'){
				reverse(org.begin(),org.end());
			}else if (trans[i] == 'M'){
				for (int j = 0; j < org.size(); j++){
					if (isdigit(org[j])){
						int tmp = (org[j] - 48 + 1 + 10 )%10;
						org[j] = (tmp + '0');	
					}
				}
			}else if (trans[i] == 'P'){
				for (int j = 0; j < org.size(); j++){
					if (isdigit(org[j])){
						int tmp = (org[j] - 48 - 1 + 10)%10;
						org[j] = (tmp + '0');	
					}
				}
			}
		}

		reverse(org.begin(),org.end());
		cout << org << endl;

	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define EPS 1e-9
#define fst first
#define scd second

#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#define int long long


signed main(){
  cin.tie(0);	
  ios::sync_with_stdio(false);
  int n;
  cin>>n;
  string s,t;
  char c;
  rep(i,n){
    cin>>s>>t;
    repn(j,s.size()-1 ){
      // cout<<s[j]<<endl;
      //cout<<t<<endl;
      if(s[j]=='J'){
	t=t[t.size() -1]+t.substr(0,t.size()-1);
      }
      if(s[j]=='C'){
	t=t.substr(1,t.size() -1)+t[0];
      }
      if(s[j]=='E'){
	if(t.size() % 2 ==0) t=t.substr((1+t.size())/2)+t.substr(0,t.size()/2);
	else t=t.substr((1+t.size())/2)+t[t.size()/2]+t.substr(0,t.size()/2);
      }
      if(s[j]=='A') reverse(t.begin(),t.end());
      if(s[j]=='M'){
	rep(k,t.size() ){
	  if(t[k]>=48 && t[k]<57){
	    t[k]++;
	  }
	  else if(t[k]==57) t[k]-=9;
	}
      }
      if(s[j]=='P'){
	rep(k,t.size() ){
	  if(t[k]>48 && t[k]<=57){
	    t[k]--;
	  }
	  else if(t[k]==48) t[k]+=9;
	}
      }
    }
    cout<<t<<endl;
  }
  return 0;
}