<? echo $row['title']." - ".$MSG_PROBLEM."

Time Limit: 2 sec / Memory Limit: 1024 MB

Score :

400

points

You are given a string

S

consisting of A, B, C.
Let

S^{(0)}:=S

. For

i=1,2,3,\ldots

, let

S^{(i)}

be the result of simultaneously replacing the characters of

S^{(i-1)}

as follows: A → BC, B → CA, C → AB.
Answer

Q

queries. The

i

-th query is as follows.

$S$ is a string of length between $1$ and $10^5$ (inclusive) consisting of A, B, C.
$\leq Q \leq 10^5$
$\leq t_i \leq 10^{18}$
$\leq k_i \leq \min(10^{18},$ the length of $S^{(t_i)})$
$t_i, k_i$ are integers.

Input is given from Standard Input in the following format:

 $S$  $Q$  $t_1$  $k_1$  $t_2$  $k_2$  $\hspace{0.4cm}\vdots$  $t_Q$  $k_Q$

Process the

Q

queries in ascending order of index, that is, in the given order. Each answer should be followed by a newline.