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

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#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 range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;

int main(void){
    int n; cin >> n;
    while(n--){
        string order, in; cin >> order >> in;

        for(int i = order.size() - 1; 0 <= i; i--){
            switch(order.at(i)){
                case 'J':
                {
                    string front = in.substr(in.size() - 1);
                    string back = in.substr(0, in.size() - 1);
                    in = front + back;
                    break;
                }
                case 'C':
                {
                    string front = in.substr(1);
                    string back = in.substr(0, 1);
                    in = front + back;
                    break;
                }
                case 'E':
                {
                    string front = in.substr((in.size() + 1) / 2);
                    string mid = in.substr(in.size() / 2, in.size() % 2);
                    string back = in.substr(0, in.size() / 2);
                    in = front + mid + back;
                    break;
                }
                case 'A':
                {
                    reverse(all(in));
                    break;
                }
                case 'M':
                {
                    rep(i, in.size()){
                        if(in.at(i) == '9'){
                            in[i] = '0';
                        }
                        else if('0' <= in.at(i) && in.at(i) <= '8'){
                            in[i]++;
                        }
                    }
                    break;
                }
                case 'P':
                {
                    rep(i, in.size()){
                        if(in.at(i) == '0'){
                            in[i] = '9';
                        }
                        else if('1' <= in.at(i) && in.at(i) <= '9'){
                            in[i]--;
                        }
                    }
                    break;
                }
                default:
                {
                    break;
                }    
            }
        }
        cout << in << endl;
    }

	return 0;
}

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

string A(string s){
  reverse(s.begin(), s.end());
  return s;
}
string C(string s){
  return s.substr(1, s.length() - 1) + s[0];
}
string J(string s){
  return s.back() + s.substr(0, s.length() - 1);
}
string E(string s){
  string res = s.substr((s.length() + 1)/2);
  if(s.length()%2 != 0)res += s[s.length()/2];
  res += s.substr(0, s.length()/2);
  return res;
}

string M(string s){
  string res = s;
  for (int i = 0; i < s.length(); i++) {
    if('0' <= res[i] and res[i] < '9'){
      res[i]++;
    }else if(res[i] == '9'){
      res[i] = '0';
    }
  }
  return res;
}

string P(string s){
  string res = s;
  for (int i = 0; i < s.length(); i++) {
    if('0' < res[i] and res[i] <= '9'){
      res[i]--;
    }else if(res[i] == '0'){
      res[i] = '9';
    }
  }
  return res;
}

int main(){
  int n;
  std::cin >> n;
  for (int roop = 0; roop < n; roop++) {
    string ope, s;
    std::cin >> ope >> s;
    reverse(ope.begin(), ope.end());
    for (int i = 0; i < ope.length(); i++) {
      if(ope[i] == 'A'){
        s = A(s);
      }else if(ope[i] == 'E'){
        s = E(s);
      }else if(ope[i] == 'C'){
        s = C(s);
      }else if(ope[i] == 'J'){
        s = J(s);
      }else if(ope[i] == 'M'){
        s = M(s);
      }else if(ope[i] == 'P'){
        s = P(s);
      }else{
        std::cerr << "hoge" << std::endl;
      }
    }
    std::cout << s << std::endl;

  }
  return 0;
}