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++: #define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<cmath>
#include<sstream>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<utility>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<list>
#include<set>
#include<stdlib.h>
#include<time.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define repp(i,k,n) for(int i=k;i<(int)n;i++)
using namespace std;
const int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0, -1, 0 };
const int dX[8] = { 0, 1, 1, 1, 0, -1, -1, -1 }, dY[8] = { 1, 1, 0, -1, -1, -1, 0, 1 };
struct XY
{
	int x;
	int y;
};
vector<long long> Prime;
void SieveOfEratosthenes(long long e) //setup vector<long long>Prime(~x)
{
	bool *x=new bool[e];
	for (long long i = 0; i <= e; i++)x[i] = false;
	for (long long i = 2; i <= e; i++)
	{
		if (x[i]);
		else
		{
			Prime.push_back(i);
			for (long long l = i; l <= e; l += i)x[l] = true;
		}
	}
	return;
}
int StringToInt(string a)
{
	stringstream ss;
	int x;
	ss << a;
	ss >> x;
	return x;
}
string IntToString(int a)
{
	stringstream ss;
	string x;
	ss << a;
	ss >> x;
	return x;
}
int GetRandom(int MIN, int MAX)
{
	static int flag=0;
	if (flag == 0)
	{
		srand((unsigned int)time(NULL));
		flag = 1;
	}
	return MIN + (int)(rand()*(MAX - MIN + 1.0) / (1.0 + RAND_MAX));
}
int in()
{
	int x;
	cin >> x;
	return x;
}
void outl(string a)
{
	cout << a << endl;
	return;
}
void outl(int a)
{
	cout << a << endl;
	return;
}
void out(string a)
{
	cout << a;
	return;
}
void out(int a)
{
	cout << a;
	return;
}
/*
(char)'1' - (int)48 = (int)1;
???1111181
 (char)A=(int)65
 (char)a=(int)97
*/
////////////////////////////////////////////////////

int main()
{
	int n;
	cin >> n;
	while (n--)
	{
		char a[1500];
		string  b;
		cin >> a >> b;
		string T;
		for (int i = strlen(a) - 1; i >= 0; i--)
		{
			switch (a[i])
			{
			case'A':
				reverse(b.begin(), b.end());
				break;
			case'J':
				T = "";
				T += b[b.size() - 1];
				for (int h = 0; h < b.size() - 1; h++)T += b[h];
				b = T;
				break;
			case'M':
				for (int l = 0; l < b.size(); l++)
				{
					if (b[l] >= '0'&&b[l] <= '9')
					{
						if (b[l] == '9')b[l] = '0';
						else b[l] += 1;
					}
				}
				break;
			case'P':
				
				for (int l = 0; l < b.size(); l++)
				{
					if (b[l] >= '0'&&b[l] <= '9')
					{
						if (b[l] == '0')b[l] = '9';
						else b[l] -= 1;
					}
				}
				break;
			case'C':
				T = "";
				for (int l = 1; l < b.size(); l++)T += b[l];
				T += b[0];
				b = T;
				break;
			case'E':
				string r="", l="",m="";
				for (int j = 0; j < b.size(); j++)
				{
					if (j < b.size() / 2)r += b[j];
					else if (j == b.size() / 2 && b.size() % 2 == 1)m += b[j];
					else l += b[j];
				}
				b = l + m + r;
				break;
			}
		}
		cout << b << endl;

	}


}

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;
}