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 <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n)  { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x)         { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
	int n;
	cin >> n;
	while (n--) {
		string order,s;
		cin >> order >> s;
		REP(i,order.length()) {
			string s2,s3;
			switch (order[order.length()-1-i])
			{
			case 'C':
				s2 = s.substr(1, s.length() - 1);
				s = s2 + s[0];
				break;
			case 'J':
				s2 = s.substr(0,s.length() - 1);
				s = s[s.length()-1]+s2;
				break;
			case 'E':
				s2 = s.substr(0, s.length() / 2);
				s3 = s.substr(s.length() - s.length() / 2, s.length() / 2);
				if (s.length() % 2 == 0)
					s = s3 + s2;
				else
					s = s3 + s[s.length() / 2] + s2;
				break;
			case 'A':
				REP(j, s.length() / 2)
					swap(s[j], s[s.length() - 1 - j]);
				break;
			case 'M':
				REP(j, s.length())
					if (isdigit(s[j]))
						s[j] = (((s[j] - '0') + 11) % 10) + '0';
				break;
			case 'P':
				REP(j, s.length())
				if (isdigit(s[j]))
					s[j] = (((s[j] - '0') + 19) % 10) + '0';
				break;
			}
		}
		cout << s << endl;
	}
}

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

#define all(c) (c).begin(),(c).end()

using namespace std;

void J(string &s){
  string a="";
  a+=s.substr(1,s.size()-1);
  a+=s[0];
  s=a;
}

void C(string &s){
  string a="";
  a+=s[s.size()-1];
  a+=s.substr(0,s.size()-1);
  s=a;
}

void E(string &s){
  string a="";
  if(s.size()%2==1){
    a+=s.substr(s.size()/2+1,s.size()/2);
    a+=s[s.size()/2+1];
    a+=s.substr(0,s.size()/2);
  }
  else {
    a+=s.substr(s.size()/2,s.size()/2);
    a+=s.substr(0,s.size()/2);
  }
  s=a;
}

void A(string &s){
  reverse(all(s));
}

void P(string &s){
  for(int i=0;i<s.size();i++){
    if(s[i]=='9')s[i]='0';
    else if(isdigit(s[i]))s[i]++;
  }
}

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

int main(void){
  int n;
  string s,com;
  cin >> n;
  while(n--){
    cin >> com >> s;
    for(int i=0;i<com.size();i++){
      if(com[i]=='J')J(s);
      else if(com[i]=='C')C(s);
      else if(com[i]=='E')E(s);
      else if(com[i]=='A')A(s);
      else if(com[i]=='P')P(s);
      else M(s);
    }
    cout << s << endl;
  }
  
  
  return 0;
}

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

int main(){
  int n;
  cin>>n;
  for(int i=0;i<n;i++){
    char a[7],ans[26],b[26],x=0,y=0;
    scanf("%s",a);
    x=strlen(a);
    scanf("%s",ans);
    y=strlen(ans);  
    for(int k=x-1;k>=0;k--){

      if(a[k]=='C'){//??????
	b[y-1]=ans[0];
	for(int j=1;j<y;j++) b[j-1]=ans[j];
      }
      else if(a[k]=='J'){//??????
	b[0]=ans[y-1];
	for(int j=0;j<y-1;j++) b[j+1]=ans[j];
      }
      else if(a[k]=='E'){//swap
	if(y%2==0)
	  for(int j=0;j<y/2;j++) 
	    swap(ans[j],ans[j+(y/2)]);
	else
	  for(int j=0;j<y/2;j++) 
	    swap(ans[j],ans[j+(y/2)+1]);

	for(int j=0;j<y;j++)
	  b[j]=ans[j];

      }
      else if(a[k]=='A'){//????????????
	int o=y;
	while(1){
	  if(o==0)break;
	  for(int j=0;j<y;j++){
	    b[j]=ans[o-1];
	    o--;
	  }
	}
      }
      else if(a[k]=='M'){//+1
	for(int j=0;j<y;j++) 
	  if(ans[j]>='0'&&ans[j]<='8') b[j]=ans[j]+1;
	  else if(ans[j]=='9') b[j]=ans[j]-9;
    }
      else if(a[k]=='P')//-1
	for(int j=0;j<y;j++) 
	  if(ans[j]>='1'&&ans[j]<='9') b[j]=ans[j]-1;
	  else if(ans[j]=='0') b[j]=ans[j]+9;

      for(int j=0;j<y;j++)
	ans[j]=b[j];
  }       
      for(int j=0;j<y;j++)
	cout<<ans[j];
      cout<<endl;
  }
  return 0;
}