#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MOD (1000000007)
#define IV (MOD/2+1ll)
#define MX (1<<17)
#define SQ (222)
char s[MX],c,d;
int N,Q,a,b,A[MX],O[MX],P[MX]={1},I[MX]={1};
struct MOQ{
    int b,e,i;
    bool operator<(const MOQ&r)const{return b/SQ^r.b/SQ?b/SQ<r.b/SQ:e<r.e;}
};
struct MO{
    MOQ T[MX];
    int C[MX],L,b,e;
    void CLR(){L=0;}//clr not tested
    void QY(int b,int e){T[L]={min(b,e),max(b,e),L};++L;}
    void GO(int*O){
        CL(C,0),st();
        sort(T,T+L),b=T[0].b-1,e=T[0].b-1;
        F(L){
            while(b>=T[i].b)add(b--,0);
            while(e<T[i].e)add(++e,1);
            while(b+1<T[i].b)del(++b,0);
            while(e>T[i].e)del(e--,1);
            O[T[i].i]=ans();
        }
    }
    //MO
    int H,U,u,S,G;
    void add(int w,bool x){
        ++S;
        G+=(c==d)&&s[w]==c;
        if(x){
            if(s[w]==d)H+=U,H%=MOD,u+=P[S-1],u%=MOD;
            U=U*2%MOD;
            if(s[w]==c)++U;
        }else{
            if(s[w]==c)H+=u,H%=MOD,U+=P[S-1],U%=MOD;
            u=u*2%MOD;
            if(s[w]==d)++u;
        }
//        printf("ADD (%c)[%d] => (%d|%d) [%d]\n",s[w],x,U,u,H);
    }
    void del(int w,bool x){
        --S;
        G-=(c==d)&&s[w]==c;
        if(x){
            if(s[w]==c)U=(U+MOD-1)%MOD;
            U=U*IV%MOD;
            if(s[w]==d)H=H-U+MOD,H%=MOD,u+=MOD-P[S],u%=MOD;
        }else{
            if(s[w]==d)u=(u+MOD-1)%MOD;
            u=u*IV%MOD;
            if(s[w]==c)H=(H-u+MOD)%MOD,U+=MOD-P[S],U%=MOD;
        }
//        printf("DEL (%c)[%d] => (%d|%d) [%d]\n",s[w],x,U,u,H);
    }
    int ans(){
//        D(H)
        return (H+G)%MOD;
    }
    void st(){H=U=u=S=G=0;}
}T;
int main(void){
    FT(1,MX)P[k]=P[k-1]*2%MOD,I[k]=I[k-1]*IV%MOD;
    scanf("%d%s %c %c%d",&N,s,&c,&d,&Q),T.CLR();
    F(Q)scanf("%d%d",&a,&b),T.QY(a,b);
    T.GO(O);
    F(Q)printf("%d\n",O[i]);
    return 0;
}