//Δ_1002
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 111111;
const int M = 26;
char ch[N];
int n,q,a[N][M];
int main()
{
    int tc,tt,i,j,x;
    scanf("%d",&tc);
    for(tt=1;tt<=tc;tt++){
        memset(a,0,sizeof(a));
        scanf("%d%d%s",&n,&q,ch+1);
        for(i=1;i<=n;i=i+1){
            a[i][ch[i]-'A']++;
            for(j=0;j<M;j=j+1)
                a[i][j]+=a[i-1][j];
        }
        cout<<"Case #"<<tt<<":\n";
        while(q--){
            scanf("%d%d",&i,&j);
            i--;
            for(x=0;a[j][x]==a[i][x];x++);
            printf("%d\n",a[j][x]-a[i][x]);
        }
    }
    return 0;
}