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 : '0');
			}
		}
		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 <bits/stdc++.h>
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]=='P')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 <bits/stdc++.h>
using namespace std;

int main(void){
  int n; cin >> n;
  while(n--){
    string order, message;
    cin >> order >> message;
    reverse(order.begin(), order.end());
    for(int pos = 0; pos < order.length(); pos++){
      int len = message.length();
      if(order[pos]  == 'C'){
        char c = message[0];
        for(int i=0; i < len-1; i++){
          message[i] = message[i+1];
        }
        message[len-1] = c;
      }
      if(order[pos]  == 'J'){
        char c = message[len-1];
        for(int i=len-1; i >= 1; i--){
          message[i] = message[i-1];
        }
        message[0] = c;
      }
      if(order[pos]  == 'E'){
        if(len % 2 == 0){
          message = message.substr(len/2, len/2) + message.substr(0, len/2);
        }else{
          message = message.substr(len/2 + 1, len/2) + message.substr(len/2, 1) + message.substr(0, len/2);
        }
      }
      if(order[pos]  == 'A'){
        reverse(message.begin(), message.end());
      }
      if(order[pos]  == 'M'){
        for(int i = 0; i < len; i++){
          if(isdigit(message[i])){
            if(message[i] - '0' == 9) message[i] = '0';
            else{
              message[i] = message[i] - '0' + 1 + '0';
            }
          }
        }
      }
      if(order[pos]  == 'P'){
        for(int i = 0; i < len; i++){
          if(isdigit(message[i])){
            if(message[i] - '0' == 0) message[i] = '9';
            else{
              message[i] = message[i] - '0' - 1 + '0';
            }
          }
        }
      }
    }
    cout << message << endl;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;

int main() {
	int n; scanf("%d", &n);
	vector<string>v;
	rep(i, n) {
		string m, s; cin >> m >> s;
		reverse(m.begin(), m.end());
		for (char c : m) {
			switch (c) {
			case'C':rotate(s.begin(), ++s.begin(), s.end()); break;
			case'J':rotate(s.begin(), --s.end(), s.end()); break;
			case'E':s = s.substr(s.size() / 2 + s.size() % 2) + s.substr(s.size() / 2, s.size() % 2) + s.substr(0, s.size() / 2); break;
			case'A':reverse(s.begin(), s.end()); break;
			case'M':transform(s.begin(), s.end(), s.begin(), [](char c) {
				if (c == '9')return'0';
				if ('0' <= c&&c < '9')return ++c;
			}); break;
			case'P':transform(s.begin(), s.end(), s.begin(), [](char c) {
				if (c == '0')return'9';
				if ('0' < c&&c <= '9')return --c;
			}); break;
			}
		}
		v.push_back(s);
	}
	for (auto s : v) {
		cout << s << endl;
	}
}