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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

void J(string& str){
  if(SZ(str)==1) return;
  rotate(str.begin(), str.end()-1, str.end());
}
void C(string& str){
  if(SZ(str)==1) return;
  rotate(str.begin(), str.begin()+1, str.end());
}
void E(string& str){
  if(SZ(str)%2 == 1){
	string s1 = str.substr(0, SZ(str)/2);
	string s2 = str.substr(SZ(str)/2+1);
	str = s2 + str[SZ(str)/2] + s1;	
  }
  else{
	string s1 = str.substr(0, SZ(str)/2);
	string s2 = str.substr(SZ(str)/2);
	str = s2 + s1;
  }
}
void A(string& str){
  reverse(ALL(str));
}
void P(string& str){
  int org = SZ(str);
  REP(i,SZ(str))
	if(isdigit(str[i]))
	  if(str[i] == '0')
		str[i] = '9';
	  else
		--str[i];
}
void M(string& str){
  REP(i,SZ(str))
	if(isdigit(str[i]))
	  if(str[i] == '9')
		str[i] = '0';
	  else
		++str[i];
}
  

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;
  REP(n,N){
	string p, msg; cin >> p >> msg;
	for(int i=SZ(p)-1;i>=0;--i)
	  switch(p[i]){
	  case 'J':
		J(msg); break;
	  case 'C':
		C(msg); break;
	  case 'E':
		E(msg); break;
	  case 'A':
		A(msg); break;
	  case 'P':
		P(msg); break;
	  case 'M':
		M(msg); break;
	  }
	cout << msg << endl;
  }
  
  return 0;
}

C++: //pku 2041
//std::stringのれんしぅでしゅ
 
#include <iostream>
#include <algorithm>
#define between(n,x,m) (((n)<=(x))&&((x)<=(m)))
using namespace std;

void J(string &str){rotate(str.begin(),str.begin()+(str.size()-1),str.end());}
void C(string &str){rotate(str.begin(),str.begin()+1,str.end());}
void E(string &str){
	int i=(str.size())/2;
	string tmp=str;
	str.replace(0,i,tmp,str.length()-i,i);
	str.replace(str.length()-i,i,tmp,0,i);
}

void A(string &str){reverse(str.begin(),str.end());}

void P(string &str){
	int i=str.size();
	for(;i>=0;--i){
		if(between('0',str[i],'9')){
			str[i]--;
			if(str[i]=='/')str[i]='9';
		}
	}
}

void M(string &str){
	int i=str.size();
	for(;i>=0;--i){
		if(between('0',str[i],'9')){
			str[i]++;
			if(str[i]==':')str[i]='0';
		}
	}
}


struct x{
	string &str;
	x(string &_str):str(_str){}
	void operator()(char c){
		switch(c){
			case 'J': J(str);break;
			case 'C': C(str);break;
			case 'E': E(str);break;
			case 'A': A(str);break;
			case 'P': P(str);break;
			default:  M(str);break;
		}
	}
};

int main(){
	string filter,str;
	int n;
	for(cin>>n;n--;cout<<str<<endl){
		cin>>filter>>str;
		for_each(filter.rbegin(), filter.rend(), x(str));
	}
}

C++: #include <iostream>
#include <string>
using namespace std;
int main() {
  int n, l, m;
  string s, t;
  char u, p;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> s;
    cin >> t;
    l = s.size();
    m = t.size();
    for (int i = l-1; i >= 0; --i) {
      p = s[i];
      if (p == 'P') {
	for (int j = 0; j < m; ++j) {
	  if (t[j] == '0') t[j] = '9';
	  else if ('0' < t[j] && t[j] <= '9') {
	    t[j] = t[j] - 1;
	  }
	}
      } else if (p == 'M') {
	for (int j = 0; j < m; ++j) {
	  if (t[j] == '9') t[j] = '0';
	  else if ('0' <= t[j] && t[j] < '9') {
	    t[j] = t[j] + 1;
	  }
	}
      } else if (p == 'C') {
	u = t[0];
	for (int j = 0; j < m-1; ++j) t[j] = t[j+1];
	t[m-1] = u;
      } else if (p == 'A') {
	for (int j = 0; j < m/2; ++j) {
	  u = t[m-1-j];
	  t[m-1-j] = t[j];
	  t[j] = u;
	}
      } else if (p == 'E') {
	for (int j = 0; j < m/2; ++j) {
	  u = t[m/2+m%2+j];
	  t[m/2+m%2+j] = t[j];
	  t[j] = u;
	}
      } else if (p == 'J') {
	u = t[m-1];
	for (int j = m-1; j > 0; --j) t[j] = t[j-1];
	t[0] = u;
      }
      //      cout << p << " " << t << endl;
    }
    cout << t << endl;
  }
  return 0;
}