#include<iostream>
#include<cstdio>
#include<set>
#define N 120000
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
struct reads
{
    int l,r;
    char data;
    bool operator < (const reads &t)const
    {
	return r<t.r;    
    }
};
char c[N+1];
int n,m,q,res,a[N+1],A[N+1];
set<reads>s;
char query(int x)
{
    auto it=s.lower_bound((reads){0,x});
    return (*it).data;
}
int get_r(int x)
{
    auto it=s.lower_bound((reads){0,x});
    return (*it).r;
}
int get_l(int x)
{
    auto it=s.lower_bound((reads){0,x});
    return (*it).l;
}
void adder(int l,int r,char cs)
{
    reads top;
    int sl=l,sr=r;
    while (1)
    {
	auto it=s.lower_bound((reads){0,l});
	if (it==s.end()||(*it).l>r) break;
	top=(*it);
	if (top.data=='R') res-=(top.r-top.l+1);
	s.erase(it);
	if (top.l<=l-1)
	{
	    if (top.data=='R') res+=(l-top.l);
	    s.insert((reads){top.l,l-1,top.data});
	}
	if (r+1<=top.r)
	{
	    if (top.data=='R') res+=(top.r-r);
	    s.insert((reads){r+1,top.r,top.data});
	}
    }
    auto it=s.lower_bound((reads){0,r});
    if (it!=s.end()&&(*it).data==cs) sr=(*it).r,s.erase(it);
    it=s.lower_bound((reads){0,l});
    if (it!=s.begin())
    {
	it--;
	if ((*it).data==cs) sl=(*it).l,s.erase(it);
    }
    s.insert((reads){sl,sr,cs});
    if (cs=='R') res+=(r-l+1);
    return;
}
int main()
{
    int l,r,sl,sr,op;
    n=read(),m=read();
    for (int i=1;i<=n;++i) cin>>c[i];
    for (int i=1;i<=m;++i) A[i]=read();
    q=read();
    while (q--)
    {
	l=read(),r=read(),res=n,s.clear();
	s.insert((reads){1,n,'R'});
	for (int i=1;i<=n;++i) adder(i,i,c[i]);
	for (int i=l;i<=r;++i)
	{
	    sl=sr=A[i],adder(A[i],A[i],'R'),op=0;
	    while (1)
	    {
		if (!op)
		{
		    if (sr==n)
		    {
			op=1;
			break;
		    }
		    else if (query(sr+1)=='R') sr=get_r(sr+1);
		    else sr++,op=1;
		}
		else
		{
		    if (sl==1)
		    {
			op=0;
			break;
		    }
		    else if (query(sl-1)=='B') sl=get_l(sl-1);
		    else sl--,op=0;
		}
	    }
	    if (!op) adder(sl,sr,'R');
	    else adder(sl,sr,'B');
	}
	printf("%d\n",res);
    }
    return 0;
}