#include<cstdio>

 #include<iostream>

 #include<cstring>

 #define ll long long

 using namespace std;

 const int maxn=;

 int sm[][<<|],a[maxn];

 int add[],one[];

 int i,j,k,n,m,L,R,SM;

 ll ans;

 int ra;char rx;

 inline int read(){

     rx=getchar(),ra=;

     while(rx<''||rx>'')rx=getchar();

     while(rx>=''&&rx<='')ra*=,ra+=rx-,rx=getchar();return ra;

 }

 int main(){

     n=read(),m=read();register int j;

     for(i=;i<=n;i++)a[i]=read();

     for(i=;i<=;i++)one[i]=one[i-]<<|;

     for(i=;i<=;i++){

         for(j=;j<=n;j++)sm[i][a[j]&one[i]]++;

         for(j=;j<=one[i];j++)sm[i][j]+=sm[i][j-];

     }char s[];int x;

     while(m--){

         scanf("%s",s);x=read();

         if(s[]=='A')for(i=;i<=;i++)add[i]+=x&one[i],add[i]&=one[i];

         else

             x++,L=(<<(x-))-add[x],R=one[x]-add[x],SM=,

             ans+=L>=?(sm[x][R]-(!L?:sm[x][L-])):(sm[x][R]+sm[x][one[x]]-sm[x][L+(<<x)-]);

     }

     printf("%lld\n",ans);

 }