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++: #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>

using namespace std;

typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P > PP;

int tx[] = {0,1,0,-1};
int ty[] = {-1,0,1,0};

static const double EPS = 1e-8;

//J,C,E,A,P,M

string Mr(string op,string str){
	if(op=="A"){
		reverse(str.begin(),str.end());
		return str;
	}

	else if(op=="C"){
		rotate(str.begin(),str.begin()+1,str.end());
		return str;
	}

	else if(op=="E"){
		if(str.size() % 2 == 0){
			string front = str.substr(0,str.size()/2);
			string rear = str.substr(str.size()/2,str.size()/2);
			return rear+front;
		}
		else{
			string front = str.substr(0,str.size()/2);
			string mid = str.substr(str.size()/2,1);
			string rear = str.substr(str.size()/2+1,str.size()/2);
			return rear + mid + front;
		}
	}

	else if(op=="J"){
		rotate(str.begin(),str.end()-1,str.end());
		return str;
	}

	//increament
	else if(op=="M"){
		for(int i=0;i<str.size();i++){
			if(isdigit(str[i])){
				str[i] = (str[i] < '9' ? str[i] + 1 : '0');
			}
		}
		return str;
	}

	//decrement
	else if(op=="P"){
		for(int i=0;i<str.size();i++){
			if(isdigit(str[i])){
				str[i] = (str[i] > '0' ? str[i] - 1 : '9');
			}
		}
		return str;
	}

}

int main(){
	int n;
	while(~scanf("%d",&n)){
		if(n==0) break;
		for(int i=0;i<n;i++){
			string msger;
			string msg;
			cin >> msger;
			cin >> msg;

			for(int j=msger.size()-1;j>=0;j--){
				msg = Mr(msger.substr(j,1),msg);
			}
			cout << msg << "\n";
		}
	}
}

C++: #include<iostream>
#include<string>
#include<algorithm>
using namespace std;

int main()
{
  int n;
  string s, m;
  cin >> n;
  for(int i = 0; i < n; i++)
  {
    cin >> m >> s;
    for(int j = m.length() - 1; j >= 0; j--)
    {
      switch(m[j])
      {
        case 'C':
          s = s.substr(1, s.length() - 1) + s[0];
          break;
        case 'J':
          s = s[s.length() - 1] + s.substr(0, s.length() - 1);
          break;
        case 'E':
          {
            int a = s.length() / 2, b = s.length() % 2;
            s = s.substr(a + b, a) + s.substr(a, b) + s.substr(0, a);
          }
          break;
        case 'A':
          reverse(s.begin(), s.end());
          break;
        case 'M':
          for(int k = 0; k < s.length(); k++)
            if(s[k] >= '0' && s[k] <= '9')
              s[k] = (s[k] - '0' + 1) % 10 + '0';
          break;
        case 'P':
          for(int k = 0; k < s.length(); k++)
            if(s[k] >= '0' && s[k] <= '9')
              s[k] = (s[k] - '0' + 9) % 10 + '0';
          break;
      }
    }
    cout << s << endl;
  }
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>

using namespace std;
using ll = long long;

string J(const string& S)
{
    const int N = S.size();
    string s;
    s.resize(N);
    for (int i = 0; i < N; i++) {
        s[i] = S[(i + 1) % N];
    }
    return s;
}

string C(const string& S)
{
    const int N = S.size();
    string s;
    s.resize(N);
    for (int i = 0; i < N; i++) {
        s[i] = S[(i + N - 1) % N];
    }
    return s;
}

string E(const string& S)
{
    const int N = S.size();
    const int shift = (N + 1) / 2;
    string s;
    s.resize(N);
    for (int i = 0; i < N; i++) {
        if (i + shift < N) {
            s[i] = S[i + shift];
        } else {
            s[i] = S[i - shift];
        }
    }
    return s;
}

string A(const string& S)
{
    string s = S;
    reverse(s.begin(), s.end());
    return s;
}

string P(const string& S)
{
    const int N = S.size();
    string s = S;
    for (int i = 0; i < N; i++) {
        if (s[i] >= '1' and s[i] <= '9') {
            s[i]--;
        } else if (s[i] == '0') {
            s[i] = '9';
        }
    }
    return s;
}

string M(const string& S)
{
    const int N = S.size();
    string s = S;
    for (int i = 0; i < N; i++) {
        if (s[i] >= '0' and s[i] <= '8') {
            s[i]++;
        } else if (s[i] == '9') {
            s[i] = '0';
        }
    }
    return s;
}

string op(const char c, const string& S)
{
    switch (c) {
    case 'J':
        return J(S);
    case 'C':
        return C(S);
    case 'E':
        return E(S);
    case 'A':
        return A(S);
    case 'P':
        return P(S);
    case 'M':
        return M(S);
    }
}

int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        reverse(s.begin(), s.end());
        string m;
        cin >> m;
        for (const char c : m) {
            s = op(c, s);
        }
        cout << s << endl;
    }
    return 0;
}