#include<iostream>
#include<cstdio>
#define N 10
#define M 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 p[N+1];
};
char c[N+1],cs[N+1];
int n,m,q,res,a[N+1],A[M+1];
reads tmp,delta[N+1];
reads operator + (reads a,reads b)
{
    for (int i=0;i<=n;++i) tmp.p[i]=b.p[a.p[i]];
    return tmp;
}
struct seg
{
    struct node
    {
	int l,r;
	reads data;
    };
    node tree[(M<<2)+1];
    void push_up(int k)
    {
	tree[k].data=tree[k<<1].data+tree[k<<1|1].data;
	return;
    }
    void build(int k,int l,int r)
    {
	tree[k].l=l,tree[k].r=r;
	if (l==r)
	{
	    tree[k].data=delta[A[l]];
	    return;
	}
	int mid=(l+r)>>1;
	build(k<<1,l,mid),build(k<<1|1,mid+1,r),push_up(k);
	return;    
    }
    reads query(int k,int l,int r)
    {
	if (tree[k].l==l&&tree[k].r==r) return tree[k].data;
	int mid=(tree[k].l+tree[k].r)>>1;
	if (r<=mid) return query(k<<1,l,r);
	else if (l>=mid+1) return query(k<<1|1,l,r);
	else return query(k<<1,l,mid)+query(k<<1|1,mid+1,r);
    }
};
seg T;
int main()
{
    int l,r,sl,sr,op,cnt;
    n=read(),m=read();
    for (int i=1;i<=n;++i) cin>>c[i];
    for (int i=1;i<=m;++i) A[i]=read();
    for (int i=1;i<=n;++i)
	for (int j=0;j<=n;++j)
	{
	    for (int k=1;k<=n;++k) cs[k]=(k<=j)?'R':'B';
	    sl=sr=i,cs[i]='R',op=cnt=0;
	    while (1)
	    {
		if (!op)
		{
		    if (sr==n)
		    {
			op=1;
			break;
		    }
		    else if (cs[sr+1]=='R') sr++;
		    else sr++,op=1;
		}
		else
		{
		    if (sl==1)
		    {
			op=0;
			break;
		    }
		    else if (cs[sl-1]=='B') sl--;
		    else sl--,op=0;
		}
	    }
	    if (!op)
	    {
		for (int i=sl;i<=sr;++i) cs[i]='R';
	    }
	    else
	    {
		for (int i=sl;i<=sr;++i) cs[i]='B';
	    }
	    for (int k=1;k<=n;++k) cnt+=(cs[k]=='R');
	    delta[i].p[j]=cnt;
	}
    T.build(1,1,m),q=read();
    while (q--) l=read(),r=read(),printf("%d\n",T.query(1,l,r).p[n]);
    return 0;
}