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;

string o, m;

void solve() {
	int len = (int)o.size();
	int sz = (int)m.size();
	
	for (int i = len - 1; i >= 0; i--) {
		switch (o[i]) {
		case 'J':
			m = m[sz - 1] + m.substr(0, sz - 1);
			break;
		case 'C':
			m = m.substr(1, sz - 1) + m[0];
			break;
		case 'E':
			if (sz % 2) {
				m = m.substr(0, sz / 2) + m[sz / 1 + 1] + m.substr(sz / 2 + 2, sz / 2);
			} else {
				m = m.substr(0, sz / 2) + m.substr(sz / 2 + 1, sz / 2);
			}
			break;
		case 'A':
			reverse(m.begin(), m.end());
			break;
		case 'P':
			for (int i = 0; i < sz; i++) {
				if ('1' <= m[i] && m[i] <= '9') {
					char c = m[i] - 1;
					m[i] = c;
				} else if (m[i] == '0') m[i] = '9';
			}
			break;
		case 'M':
			for (int i = 0; i < sz; i++) {
				if ('0' <= m[i] && m[i] <= '8') {
					char c = m[i] + 1;
					m[i] = c;
				} else if (m[i] == '9') m[i] = '0';
			}
			break;
		default:
			break;
		}
	}
	
	cout << m << endl;
}

int main() {
	int n; cin >> n;
	
	for (int i = 0; i < n; i++) {
		cin >> o;
		cin >> m;
		solve();
	}
	
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

int main(void){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int64 n;
	cin >> n;
	REP(_, n) {
		string op, s;
		cin >> op >> s;
		reverse(all(op));
		REP(i, op.size()) {
			if (op[i] == 'C') {
				s = s.substr(1, s.size()-1) + s[0];
			} else if (op[i] == 'J') {
				s = s.back() + s.substr(0, s.size()-1);
			} else if (op[i] == 'E') {
				if (s.size() % 2) {
					s = s.substr(s.size()/2+1, s.size()/2) + s[s.size()/2] + s.substr(0, s.size()/2);
				} else {
					s = s.substr(s.size()/2, s.size()/2) + s.substr(0, s.size()/2);
				}
			} else if (op[i] == 'A') {
				reverse(all(s));
			} else if (op[i] == 'M') {
				REP(j, s.size()) {
					if ('0' <= s[j] && s[j] <= '9') {
						s[j] = (char)((s[j]-'0'+1)%10+'0');
					}
				}
			} else {
				REP(j, s.size()) {
					if ('0' <= s[j] && s[j] <= '9') {
						s[j] = (char)((s[j]-'0'+9)%10+'0');
					}
				}
			}
		}
		cout << s << endl;
	}
}

C++: #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;

#define INF 1000000000

int main(){
  int n;
  cin>>n;
  rep(repeat, n){
    char rule[10];
    scanf("%s", rule);
    string s;
    cin>>s;

    int sz=s.size();
    for(int i=strlen(rule)-1; i>=0; i--){
      switch(rule[i]){
      case 'J':
	s = s.substr(sz-1,1) + s.substr(0, sz-1);
	break;
      case 'C':
	s = s.substr(1, sz-1) + s.substr(0,1);
	break;
      case 'E':
	s = s.substr((sz+1)/2, sz/2) + s.substr(sz/2, sz%2)
	  + s.substr(0, sz/2);
	break;
      case 'A':
	reverse(all(s));
	break;
      case 'P':
	rep(j,sz){
	  if(s[j]>='1' && s[j]<='9') s[j]--;
	  else if(s[j]=='0') s[j]='9';
	}
	break;
      case 'M':
	rep(j,sz){
	  if(s[j]>='0' && s[j]<='8') s[j]++;
	  else if(s[j]=='9') s[j]='0';
	}
	break;
      default:
	cout<<"BUG"<<endl;
      }
    }
    cout<<s<<endl;
  }
  return 0;
}