#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <map>
#include <cmath>
using namespace std;
typedef long long LL;
const int mod = 1e9+7;
const int N = 100010;

struct node
{
    LL num ,cnt;
    int id ;
    bool is_Q;
} e[N] ,Q[N] ;

LL quick_mod( LL a , LL b )
{
    LL res = 1 ;
    while( b )
    {
        if( b&1 ) res = res * a % mod ;
        a = a * a % mod ;
        b >>= 1;
    }
    return res ;
}


int main()
{
    #ifdef LOCAL
        freopen("in.txt","r",stdin);
    #endif // LOCAL

    int _ ,n , m ;
    char s[5];
    LL x ;
    scanf("%d",&_);
    while( _-- ){
        scanf( "%d%d",&n,&m );
        for( int i = 0 ; i < m ; ++i ){
            scanf("%s%I64d",s,&x);
            if( s[0] == ‘Q‘ )  e[i].is_Q = 1;
            else e[i].is_Q = 0 ;
            e[i].num = x , e[i].id = i , e[i].cnt = 1 ;
        }

        while( m > 0 && !e[m-1].is_Q ) m--;

        int tail = 0 ;

        for( int i = m -1  ; i >= 0 ; --i ){

            if( e[i].is_Q ){ Q[tail++] = e[i] ; continue ; }

            for( int j = 0; j < tail ; ++j ){
                if( e[i].num == 1 ){
                    int mid = ( n + 1 ) / 2 ;
                    if( Q[j].num <= mid ) Q[j].num = 2 * Q[j].num - 1 ;
                    else Q[j].num = 2 * ( Q[j].num - mid );
                }
                else if( e[i].num == 2 ){
                    Q[j].num = n - Q[j].num + 1 ;
                }
                else {
                    Q[j].cnt = Q[j].cnt * 2 % (mod - 1) ;
                }
            }

        }
        for( int j = tail - 1 ; j >=0 ; --j ){
            printf("%I64d\n",quick_mod( Q[j].num , Q[j].cnt));
        }
    }
}