#216625. [GKS 2016 #E] Diwali lightings

Diwali is the festival of lights. To celebrate it, people decorate their houses with multi-color lights and burst crackers. Everyone loves Diwali, and so does Pari. Pari is very fond of lights, and has transfinite powers, so she buys an infinite number of red and blue light bulbs. As a programmer, she also loves patterns, so she arranges her lights by infinitely repeating a given finite pattern .

For example, if is BBRB, the infinite sequence Pari builds would be BBRBBBRBBBRB... .

Blue is Pari's favorite color, so she wants to know the number of blue bulbs between the Ith bulb and Jth bulb, inclusive, in the infinite sequence she built (lights are numbered with consecutive integers starting from 1). In the sequence above, the indices would be numbered as follows:

B B R B B B R B B B  R  B...
1 2 3 4 5 6 7 8 9 10 11 12

So, for example, there are blue lights between the th and th positions, but only between the th and th.

Since the sequence can be very long, she wrote a program to do the count for her. Can you do the same?

The first line of the input gives the number of test cases, . test cases follow. First line of each test case consists of a string , denoting the initial finite pattern. Second line of each test case consists of two space separated integers and , defined above.

For each test case, output one line containing Case #x: y, where is the test case number (starting from 1) and is number of blue bulbs between the Ith bulb and Jth bulb of Pari's infinite sequence, inclusive.

样例输入 1

3
BBRB
4 8
BBRB
10 12
BR
1 1000000

样例输出 1

Case #1: 4
Case #2: 2
Case #3: 500000

Cases #1 and #2 are explained above.

In Case #3, bulbs at odd indices are always blue, and bulbs at even indices are always red, so there are half a million blue bulbs between positions 1 and .

Limits

.

length of .

Each character of is either uppercase B or uppercase R.

Small dataset (Test set 1 - Visible)

.

Large dataset (Test set 2 - Hidden)

.