#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;

int N;
string order;
string king;

void solve(){
  for(int i=order.length()-1; i>=0; i--){
    
    char o = order[i];
    int l = king.length();
    if(o == 'A'){
      reverse(king.begin(), king.end());
    }else if(o == 'C'){
      king = king.substr(1) + king[0];
    }else if(o == 'J'){
      king = king[l-1] + king.substr(0, l-1);
    }else if(o == 'E'){
      if((l % 2) == 0){
	king = king.substr(l / 2) + king.substr(0, l / 2);
      }else{
	king = king.substr(l / 2 + 1) + king[l / 2] + king.substr(0, l / 2);
      }
    }else if(o == 'M'){
      for(int j=0; j<l; j++){
	if(king[j] >= '0' && king[j] < '9'){
	  king[j]++;
	}else if(king[j] == '9'){
	  king[j] = '0';
	}
      }
    }else if(o == 'P'){
      for(int j=0; j<l; j++){
	if(king[j] > '0' && king[j] <= '9'){
	  king[j]--;
	}else if(king[j] == '0'){
	  king[j] = '9';
	}
      }      
    }
  }
}

int main(){
  ifstream cin("message.txt");
  cin >> N;
  for(int i=0; i<N; i++){
    cin >> order >> king;
    solve();
    cout << king << endl;
  }
  return 0;
}