// In The Name of GOD
#include <algorithm>
#include <iostream>
#include <memory.h>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <list>
#include <map>
#include <set>
#include <time.h>

using namespace std;

#define int64 long long
#define P pair<int, int>
#define Mod 1000000007LL

int n, w, q, l, r,a[100002],b[26]; char c;
string s;
int main(){

	cin >> w;
	for (int o = 1; o <= w; o++)
	{
		cout << "Case #" << o << ":"<<endl;
		cin >> s >> q;
		for (int i = 0; i < s.size(); i++)
			a[i] = s[i];
		for (int i = 0; i < q; i++)
		{
			cin >> c >> l >> r;
			if (c == 'g')
			{
				for (int j = l; j <= r; j++)
					b[a[j] - 'A']++;
				for (int j = 0; j < 25; j++)
					cout << b[j] << ' ';
				cout << b[25] << endl;
				memset(b, 0, sizeof b);
			}
			else
				sort(a + l, a +r+1);
		}
		
	}

	return 0;
}
///Havij vru!