#include<cstdio>

#include<cmath>

#include<algorithm>

char buf[],*ptr=buf-;

int _(){

    int x=,c=*++ptr;

    while(c<)c=*++ptr;

    while(c>)x=x*+c-,c=*++ptr;

    return x;

}

typedef unsigned int u32;

const int P=,N=;

int n,q,xs[N][];

int hx[P][],idp=;

int getid(int x){

    int w=x%P;

    while(hx[w][]){

        if(hx[w][]==x)return hx[w][];

        if((w+=)>=P)w-=P;

    }

    hx[w][]=x;

    return hx[w][]=++idp;

}

u32 as[N],pos[N],B,ans=,t[N*];

struct Q{

    int l,r,id;

}qs[N];

bool operator<(Q a,Q b){

    if(pos[a.l]!=pos[b.l])return pos[a.l]<pos[b.l];

    if(a.r!=b.r)return (a.r<b.r)^(pos[a.l]&);

    return a.id<b.id;

}

void ins(int*x){

    for(int i=;i<=;++i)ans+=t[x[i]];

    ++t[x[]];

}

void del(int*x){

    --t[x[]];

    for(int i=;i<=;++i)ans-=t[x[i]];

}

int main(){

    fread(buf,,sizeof(buf),stdin)[buf]=;

    n=_();q=_();

    B=(n+)/sqrt(q+)+;

    for(int i=;i<=n;++i)pos[i]=i/B;

    while(*ptr<'a')++ptr;

    for(int i=;i<=n;++i)xs[i][]=xs[i-][]^<<*ptr++-'a';

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

        for(int j=;j<;++j)xs[i][j]=xs[i][]^<<j;

    }

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

        for(int j=;j<=;++j)xs[i][j]=getid(xs[i][j]);

    }

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

        qs[i].l=_()-;

        qs[i].r=_();

        qs[i].id=i;

    }

    std::sort(qs,qs+q);

    int L=,R=;

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

        int l=qs[i].l,r=qs[i].r;

        while(L>l)ins(xs[--L]);

        while(R<r)ins(xs[++R]);

        while(L<l)del(xs[L++]);

        while(R>r)del(xs[R--]);

        as[qs[i].id]=ans;

    }

    for(int i=;i<q;++i)printf("%u\n",as[i]);

    return ;

}