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 <bits/stdc++.h>
#define ll long long
using namespace std;

int main() {
    int n;
    cin >> n;
    while (n--) {
        string ord, msg;
        cin >> ord >> msg;
        reverse(ord.begin(), ord.end());
        for (int i = 0; i < ord.size(); i++) {
            if (ord[i] == 'C') {
                char c = msg[0];
                msg.erase(0, 1);
                msg.push_back(c);
            } else if (ord[i] == 'J') {
                char c = msg[msg.size() - 1];
                msg.erase(msg.size() - 1, 1);
                msg.insert(msg.begin(), c);
            } else if (ord[i] == 'E') {
                int cnt = msg.size() / 2;
                string s, s1, s2;
                if (msg.size() % 2) {
                    s = msg[cnt];
                    s1 = msg.substr(0, cnt);
                    s2 = msg.substr(cnt + 1, cnt);
                } else {
                    s = "";
                    s1 = msg.substr(0, cnt);
                    s2 = msg.substr(cnt, cnt);
                }
                msg = s2 + s + s1;
            } else if (ord[i] == 'A') {
                reverse(msg.begin(), msg.end());
            } else if (ord[i] == 'M') {
                for (int j = 0; j < msg.size(); j++) {
                    if ('0' <= msg[j] && msg[j] <= '9') {
                        if (msg[j] == '9')
                            msg[j] = '0';
                        else
                            msg[j] = msg[j] + 1;
                    }
                }
            } else if (ord[i] == 'P') {
                for (int j = 0; j < msg.size(); j++) {
                    if ('0' <= msg[j] && msg[j] <= '9') {
                        if (msg[j] == '0')
                            msg[j] = '9';
                        else
                            msg[j] = msg[j] - 1;
                    }
                }
            }
        }
        cout << msg << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

string J(string S) {
    char c = S.front();
    S.erase(begin(S));
    return S + c;
}
string C(string S) {
    char c = S.back();
    S.pop_back();
    return c + S;
}
string E(string S) {
    string a, b;
    a = S.substr(0, S.length() / 2);
    b = S.substr(S.length() / 2);
    return b + a;
}
string A(string S) {
    REVERSE(S);
    return S;
}
string P(string S) {
    REP(i, S.length()) {
        if (isdigit(S[i])) {
            S[i] = ((S[i] - '0' + 11) % 10) + '0';
        }
    }
    return S;
}
string M(string S) {
    REP(i, S.length()) {
        if (isdigit(S[i])) {
            S[i] = ((S[i] - '0' + 9) % 10) + '0';
        }
    }
    return S;
}

void solve(int N) {
    vector<pair<string, string>> m(N);
    for_each(ALL(m), [](auto &e){cin >> e.first >> e.second;});
    FORE(el, m) {
        string ans = el.second;
        FORE(e, el.first) {
            switch (e) {
            case 'J':
                ans = J(ans);
                break;
            case 'C':
                ans = C(ans);
                break;
            case 'E':
                ans = E(ans);
                break;
            case 'A':
                ans = A(ans);
                break;
            case 'P':
                ans = P(ans);
                break;
            case 'M':
                ans = M(ans);
                break;
            }
        }
        cout << ans << endl;
    }
    return;
}

signed main(void) {
    int n, m, p, a, b, c, x, y, z, q;
    string s;
    bool f = false;
    while (cin >> n, n) {
        solve(n);
        return 0;
    }
}