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 <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;

string func(string message, char type) {
  int m = message.size();
  string res = message;
  if (type == 'J') {
    res = string(1, message[m-1]) + message.substr(0, m-1);
  } else if (type == 'C') {
    res = message.substr(1) + string(1, message[0]);
  } else if (type == 'E') {
    res = message.substr((m+1)/2) + (m%2?string(1, message[m/2]):"") + message.substr(0, m/2);
  } else if (type == 'A') {
    reverse(ALL(res));
  } else if (type == 'P') {
    REP(i, m)
      if (isdigit(message[i]))
        res[i] = (message[i] == '0') ? '9' : message[i]-1;
  } else if (type == 'M') {
    REP(i, m)
      if (isdigit(message[i]))
        res[i] = (message[i] == '9') ? '0' : message[i]+1;
  }
  return res;  
}
int main() {
  int n;
  cin >> n;
  while(n--) {
    string order, message;
    cin >> order >> message;
    for (int i=order.size()-1; i>=0; --i) {
      message = func(message, order[i]);
    }
    cout << message << endl;
  }
}

C++: #include <iostream>
#include <algorithm>
#include <string.h>
#include <cstdio>
#include <map>
#include <queue>
#define INF 10000000

using namespace std;

int main(){
  int n;
  string str,odr;
  cin >> n;
  while(n--){
    cin >> odr;
    cin >> str;
    int size = str.size();
    string tmp = "";
    for(int i = odr.size()-1 ; i >= 0 ; i-- ){
      switch(odr[i]){
      case 'A':
	reverse(str.begin(),str.end());
	break;
      case 'C':
	tmp = "";
	for(int i = 1 ; i < size ; i++ ){
	  tmp += str[i];
	}
	str = tmp+str[0];
	break;
      case 'J':
	tmp = "";
	for(int i = 0 ; i < size-1 ; i++ ){
	  tmp += str[i];
	}
	str = str[size-1] + tmp;
	break;
      case 'M':
	for(int i = 0 ; i < size ; i++ ){
	  if('0' <= str[i] && str[i] <= '8'){
	    str[i] = char(str[i]+1);
	  }else if(str[i] == '9'){
	    str[i] = '0';
	  }
	}
	break;
      case 'P':
	for(int i = 0 ; i < size ; i++ ){
	  if('1' <= str[i] && str[i] <= '9'){
	    str[i] = char(str[i]-1);
	  }else if(str[i] == '0'){
	    str[i] = '9';
	  }
	}
	break;
      case 'E':
	if(size%2==1){
	  str = str.substr((size/2)+1,size - size/2)+ str[size/2] + str.substr(0,(size/2)); 
	}else {
	  str = str.substr((size/2),size - size/2) + str.substr(0,(size/2));
	}
	break;
      }
    }
    cout << str << endl;
  }
  return 0;
}