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 <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi M_PI
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
// typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int m;

string J(string s){
    s = s[m-1] + s.substr(0,m-1);
    return s;
}
string C(string s){
    s = s.substr(1) + s[0];
    return s;
}
string E(string s){
    if (m % 2 == 0){
        s = s.substr(m/2) + s.substr(0,m/2);
    }else{
        s = s.substr(m/2+1) + s[m/2] + s.substr(0,m/2);
    }
    return s;
}
string A(string s){
    reverse(s.begin(), s.end());
    return s;
}
string P(string s){
    REP(i,m){
        if (s[i] >= '1' && s[i] <= '9')
            s[i]--;
        else if (s[i] == '0')
            s[i] = '9';
    }
    return s;
}
string M(string s){
    REP(i,m){
        if (s[i] >= '0' && s[i] <= '8')
            s[i]++;
        else if (s[i] == '9')
            s[i] = '0';
    }
    return s;
}

int main() {
    int n;
    cin >> n;
    while (n--){
        string s, t;
        cin >> s >> t;
        m = t.length();
        reverse(s.begin(), s.end());
        REP(i,s.length()){
            if (s[i] == 'J')
                t = J(t);
            if (s[i] == 'C')
                t = C(t);
            if (s[i] == 'E')
                t = E(t);
            if (s[i] == 'A')
                t = A(t);
            if (s[i] == 'P')
                t = P(t);
            if (s[i] == 'M')
                t = M(t);
        }
        cout << t << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	while(n--){
		string s,ss;
		cin>>s>>ss;
		for(int i=s.size()-1;i>=0;i--){
			if(s[i]=='P')
				for(int j=0;j<ss.size();j++)
					if(ss[j]>='0'&&ss[j]<='9')
						ss[j]=(ss[j]-'0'+9)%10+'0';
			if(s[i]=='M')
				for(int j=0;j<ss.size();j++)
					if(ss[j]>='0'&&ss[j]<='9')
						ss[j]=(ss[j]-'0'+1)%10+'0';
			if(s[i]=='A')reverse(ss.begin(),ss.end());
			if(s[i]=='E')for(int k=0;k<ss.size()/2;k++)swap(ss[k],ss[k+(ss.size()+1)/2]);
			if(s[i]=='J')ss=ss[ss.size()-1]+ss.substr(0,s.size()-1);
			if(s[i]=='C')ss=ss.substr(1,s.size()-1)+s[0];
		}
		cout<<ss<<endl;
	}
}

C++: #include <algorithm>
#include <cstdint>
#include <iostream>
#include <string>

using namespace std;

string lshift(string &msg) {
  string front{msg[0]};
  return msg.substr(1, msg.size() - 1) + front;
}

string rshift(string &msg) {
  string back{msg[msg.size() - 1]};
  return back + msg.substr(0, msg.size() - 1);
}

void add_num(string &msg, int32_t num) {
  for (uint32_t i = 0; i < msg.size(); i++) {
    if ('0' <= msg[i] && msg[i] <= '9') {
      msg[i] += num;
      if (msg[i] < '0') msg[i] = '9';
      if ('9' < msg[i]) msg[i] = '0';
    }
  }
}

string swap(string &msg) {
  string front = msg.substr(0, msg.size() / 2);
  if (msg.size() % 2 == 0) {
    string back = msg.substr(msg.size() / 2, msg.size() - msg.size() / 2);
    return back + front;
  } else {
    string center{msg[msg.size() / 2]};
    string back =
        msg.substr(msg.size() / 2 + 1, msg.size() - (msg.size() / 2 + 1));
    return back + center + front;
  }
}

int32_t main() {
  uint32_t n;
  cin >> n;
  for (uint32_t _ = 0; _ < n; _++) {
    string mem;
    cin >> mem;
    string msg;
    cin >> msg;

    for (int32_t i = mem.size() - 1; i >= 0; i--) {
      switch (mem[i]) {
        case 'A':
          reverse(msg.begin(), msg.end());
          break;
        case 'P':
          add_num(msg, -1);
          break;
        case 'M':
          add_num(msg, +1);
          break;
        case 'J':
          msg = rshift(msg);
          break;
        case 'C':
          msg = lshift(msg);
          break;
        case 'E':
          msg = swap(msg);
          break;
      }
    }

    cout << msg << endl;
  }

  return 0;
}