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 <string>
#include <list>
using namespace std;

int main(){
  int n;
  cin >> n;
  while(n--){
    string s,t;
    cin >> s >> t;

    list<char> p;
    for(int i=t.length()-1; i>=0; i--){
      p.push_front(t[i]);
    }

    for(int i=s.length()-1; i>=0; i--){
      if(s[i]=='J'){
	p.push_front(p.back());
	p.pop_back();
      }
      else if(s[i]=='C'){
	p.push_back(p.front());
	p.pop_front();
      }
      else if(s[i]=='E'){
	if(t.length()%2==0){
	  for(int j=0; j<t.length()/2; j++){
	    p.push_front(p.back());
	    p.pop_back();
	  }
	}
	else{
	  for(int j=0; j<(t.length()-1)/2; j++){
	    p.push_front(p.back());
	    p.pop_back();
	  }
	  list<char>::iterator it; it=p.begin();
	  for(int j=0; j<(t.length()-1)/2; j++)
	    it++;
	  p.insert(it,p.back());
	  p.pop_back();
	}
      }
      else if(s[i]=='A'){
	p.reverse();
      }
      else if(s[i]=='P'){
	for(list<char>::iterator it=p.begin(); it!=p.end(); ++it){
	  if(isdigit(*it)){
	    int a = *it-'0';
	    a+=9;
	    a%=10;
	    *it = a+'0';
	  }
	}
      }
      else{
	for(list<char>::iterator it=p.begin(); it!=p.end(); ++it){
	  if(isdigit(*it)){
	    int a = *it-'0';
	    a+=11;
	    a%=10;
	    *it = a+'0';
	  }
	}
      }
    }
    
    for(list<char>::iterator it=p.begin(); it!=p.end(); ++it)
      cout << *it;
    cout << endl;
    
  }
  return 0;
}

C++: //http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1276
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
using ll = long long;
using namespace std;

int const MOD = 1e9 + 7;
bool sieve[2000000];
int main(void)
{
    int n;
    cin >> n;
    for (int k = 0; k < n; ++k)
    {
        string order, mes;
        cin >> order >> mes;
        reverse(order.begin(), order.end());
        for (int j = 0; j < order.size(); ++j)
        {
            switch (order[j])
            {
            case 'A':
                reverse(mes.begin(), mes.end());
                break;
            case 'J':
                rotate(mes.begin(), mes.begin() + mes.size() - 1, mes.end());
                break;
            case 'C':
                rotate(mes.begin(), mes.begin() + 1, mes.end());
                break;
            case 'E':
                for (int i = 0; i < mes.size() / 2; ++i)
                {
                    swap(mes[i], mes[(mes.size() + 1) / 2 + i]);
                }
                break;
            case 'M':
                for (int i = 0; i < mes.size(); ++i)
                {
                    if (mes[i] >= '0' && mes[i] <= '8')
                    {
                        mes[i] = (char)(mes[i] + 1);
                        continue;
                    }
                    if (mes[i] == '9')
                        mes[i] = '0';
                }
                break;
            case 'P':
                for (int i = 0; i < mes.size(); ++i)
                {
                    if (mes[i] >= '1' && mes[i] <= '9')
                    {
                        mes[i] = (char)(mes[i] - 1);
                        continue;
                    }
                    if (mes[i] == '0')
                        mes[i] = '9';
                }
                break;
            }
        }
        cout << mes << endl;
    }
    return 0;
}

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

int main()
{
  int n;
  string s, m;
  cin >> n;
  for(int i = 0; i < n; i++)
  {
    cin >> m >> s;
    for(int j = m.length() - 1; j >= 0; j--)
    {
      switch(m[j])
      {
        case 'C':
          s = s.substr(1, s.length() - 1) + s[0];
          break;
        case 'J':
          //s = s[s.length() - 1] + s.substr(0, s.length() - 1);
          break;
        case 'E':
          {
            int a = s.length() / 2, b = s.length() % 2;
            //s = s.substr(a + b, a) + (b ? s.substr(a + 1, 1) : "") + s.substr(0, a);
          }
          break;
        case 'A':
          //reverse(s.begin(), s.end());
          break;
        case 'M':
          for(int k = 0; k < s.length(); k++)
            if(s[k] >= '0' && s[k] <= '9')
              s[k] = (s[k] - '0' + 1) % 10 + '0';
          break;
        case 'P':
          for(int k = 0; k < s.length(); k++)
            if(s[k] >= '0' && s[k] <= '9')
              s[k] = (s[k] - '0' - 1) % 10 + '0';
          break;
      }
    }
    cout << s << endl;
  }
}