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 <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <map>
#define _USE_MATH_DEFINES
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 30;
const double EPS = 1e-9;

string C(string s){
	string s1(s.begin()+1, s.end());
	string s2(s.begin(), s.begin()+1);
	return s1 + s2;
}

string A(string s){
	reverse(s.begin(), s.end());
	return s;
}

string J(string s){
	string s1(s.end()-1, s.end());
	string s2(s.begin(), s.end()-1);
	return s1 + s2;
}

string E(string s){
	int n = s.size();
	int d = (n / 2);
	string s1(s.begin(), s.begin() + d), s2(s.begin() + d, s.end() - d), s3(s.end() - d , s.end());
	return s3 + s2 + s1;
}

string M(string s){
	for(int i = 0; i < (int)s.size(); i++){
		if(isdigit(s[i])){
			if(s[i] == '9') s[i] = '0';
			else s[i] = (char)(s[i] + 1);
		}
	}
	return s;
}

string p(string s){
	for(int i = 0; i < (int)s.size(); i++){
		if(isdigit(s[i])){
			if(s[i] == '0') s[i] = '9';
			else s[i] = (char)(s[i] - 1);
		}
	}
	return s;
}

int main(){
	int n;
	string order, s;
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> order >> s;
		for(int j = (int)order.size()-1; j >= 0; j--){
			switch(order[j]){
			case 'A': s = A(s);
				break;
			case 'C': s = C(s);
				break;
			case 'E': s = E(s);
				break;
			case 'M': s = M(s);
				break;
			case 'P': s = p(s);
				break;
			default:
				s = J(s);
			}
		}
		cout << s << endl;
	}
	return 0;
}

C++: //1240
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
char table[10]={'0','1','2','3','4','5','6','7','8','9'};
string now;
void A(){
reverse(now.begin(),now.end());
}
void J(){
char tmp=now[0];
for(int i=0;i<now.size()-1;i++)now[i]=now[i+1];
now[now.size()-1]=tmp;
}
void E(){
string a="",b="",c="";
for(int i=0;i<now.size();i++){
if(i<now.size()/2)a.push_back(now[i]);
else if(i==now.size()/2&&now.size()%2==1)c.push_back(now[i]);
else b.push_back(now[i]);
}
//reverse(a.begin(),a.end());
//reverse(b.begin(),b.end());
now=b+c+a;
}
void C(){
char tmp=now[now.size()-1];
for(int i=now.size()-1;i>0;i--)now[i]=now[i-1];
now[0]=tmp;
}
void P(){
for(int i=0;i<now.size();i++){
	if(now[i]-'0'==0)now[i]='9';
else 	if(now[i]-'0'==1)now[i]='0';
else 	if(now[i]-'0'==2)now[i]='1';
else 	if(now[i]-'0'==3)now[i]='2';
else 	if(now[i]-'0'==4)now[i]='3';
else 	if(now[i]-'0'==5)now[i]='4';
else 	if(now[i]-'0'==6)now[i]='5';
else 	if(now[i]-'0'==7)now[i]='6';
else 	if(now[i]-'0'==8)now[i]='7';
else 	if(now[i]-'0'==9)now[i]='8';
	}
}
void M(){
for(int i=0;i<now.size();i++){
	if(now[i]-'0'==0)now[i]='1';
	else if(now[i]-'0'==1)now[i]='2';
	 else if(now[i]-'0'==2)now[i]='3';
else 	if(now[i]-'0'==3)now[i]='4';
else 	if(now[i]-'0'==4)now[i]='5';
else 	if(now[i]-'0'==5)now[i]='6';
else 	if(now[i]-'0'==6)now[i]='7';
else 	if(now[i]-'0'==7)now[i]='8';
else 	if(now[i]-'0'==8)now[i]='9';
else 	if(now[i]-'0'==9)now[i]='0';
	}
}

int main(){
	int n;
	cin>>n;
for(int kki=0;kki<n;kki++){
	string a;
	cin>>a>>now;
	for(int i=a.size();i>=0;i--){
		if(a[i]=='A')A();
		if(a[i]=='C')J();
		if(a[i]=='P')P();
		if(a[i]=='M')M();
		if(a[i]=='E')E();
		if(a[i]=='J')C();
	//cout<<now<<endl;	
	}
	cout<<now<<endl;
}

	return 0;
}

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

string p(string s){
  for(int i=0;i<s.length();i++){
    if('0'<=s[i] && s[i]<='9'){
      s[i]=s[i] -1;
      if(s[i]=='0'-1)s[i]='9';
    }
  }
  return s;

}

string m(string s){
  for(int i=0;i<s.length();i++){
    if('0'<=s[i] && s[i]<='9'){
      s[i]=(s[i] -'0'+1)%10 + '0';
    }
  }
  return s;
}

string a(string s){
  string res=s;
  for(int i=0;i<s.length()/2;i++){
    res[i]=s[s.length()-1-i];
    res[s.length()-1-i]=s[i];
  }
  return res;
}

string e(string s){
  int half=s.length()/2;
  string first,latter;
  first=s.substr(0,half);
  latter=s.substr(s.length()-half,s.length());
  if(s.length()%2==0){
    return latter + first;
  }else{
    return latter + s[half] + first;
  }
}

string j(string s){
  char tmp=s[s.length()-1];
  for(int i=s.length()-1;i>0;i--){
    s[i]=s[i-1];
  }
  s[0]=tmp;
  return s;
}

string c(string s){
  char tmp=s[0];
  for(int i=0;i<s.length()-1;i++){
    s[i]=s[i+1];
  }
  s[s.length()-1]=tmp;
  return s;
}

int main(){
  int n;
  cin>>n;
  for(int i=0;i<n;i++){
    string mg,mes;
    cin>>mg>>mes;
    for(int i=mg.length()-1;i>=0;i--){
      if(mg[i]=='A'){
	mes=a(mes);
      }else if(mg[i]=='J'){
	mes=j(mes);
      }else if(mg[i]=='C'){
	mes=c(mes);
      }else if(mg[i]=='E'){
	mes=e(mes);
      }else if(mg[i]=='P'){
	mes=p(mes);
      }else if(mg[i]=='M'){
	mes=m(mes);
      }
    }
    cout << mes << endl;
  }
  return 0;
}