#include #include using namespace std; typedef long long ll; const int N = 100010; int n, q; char s[N]; int cnt[N][26]; int main() { int t; scanf("%d", &t); for (int cs = 1; cs <= t; ++cs) { printf("Case #%d:\n", cs); scanf("%d%d", &n, &q); scanf("%s", s + 1); memset(cnt, 0, sizeof(cnt)); for (int i = 1; i <= n; ++i) cnt[i][s[i] - 'A'] = 1; for (int i = 1; i <= n; ++i) for (int j = 0; j < 26; ++j) cnt[i][j] += cnt[i - 1][j]; while (q--) { int l, r; scanf("%d%d", &l, &r); for (int i = 0; i < 26; ++i) if (cnt[r][i] - cnt[l - 1][i]) { printf("%d\n", cnt[r][i] - cnt[l - 1][i]); break; } } } return 0; }