#include<bits/stdc++.h>
using namespace std;
#define y1 y114514
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define all(a) a.begin(), a.end()
typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef long long ll;
const int M = 1000000007;

const int maxn = 100005;
int T, n, q, ca;
int cnt[maxn][26];
char s[maxn];

int main(){
    scanf("%d", &T);
    while(T--){
        scanf("%d%d", &n, &q);
        scanf("%s", s + 1);
        for(int i = 1; i <= n; ++i){
            memcpy(cnt[i], cnt[i - 1], sizeof(cnt[i - 1]));
            cnt[i][s[i] - 'A']++;
        }
        printf("Case #%d:\n", ++ca);
        while(q--){
            static int l, r;
            scanf("%d%d", &l, &r);
            int c = 0;
            while(cnt[r][c] - cnt[l - 1][c] == 0) ++c;
            printf("%d\n", cnt[r][c] - cnt[l - 1][c]);
        }
    }

    return 0;
}