Diwali lightings

Diwali is the festival of lights. Pari loves lights, so she bought an infinite number of red and blue bulbs. She also likes regular arrangements, so she lays the bulbs out in one line by repeating a finite pattern $S$ forever.

For example, if $S$ is BBRB, the bulbs are placed in the order BBRBBBRBBBRB.... Here B means blue and R means red.

The bulbs are numbered with consecutive integers starting from 1. The arrangement above is numbered like this.

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

Blue is Pari's favorite color. Count the blue bulbs from bulb $I$ through bulb $J$, inclusive.

The first line contains the number of test cases $T$. The $T$ test cases follow.

The first line of each test case contains the pattern $S$ to repeat. The second line contains two integers $I$ and $J$ separated by a single space.

For each test case, print one line in the form Case #x: y, where $x$ is the test case number starting from 1 and $y$ is the number of blue bulbs from bulb $I$ through bulb $J$, inclusive.

• $1 \le T \le 100$
• $1 \le |S| \le 100$
• Each character of $S$ is an uppercase B or an uppercase R.
• $1 \le I \le J \le 10^6$

If $S$ is BR, every odd numbered bulb is blue and every even numbered bulb is red.