Problem Statement

You are given a string $S$ of length $N$ consisting of A, C, G and T. Answer the following $Q$ queries:

• Query $i$ ($1 \leq i \leq Q$): You will be given integers $l_i$ and $r_i$ ($1 \leq l_i < r_i \leq N$). Consider the substring of $S$ starting at index $l_i$ and ending at index $r_i$ (both inclusive). In this string, how many times does AC occurs as a substring?

Note

A substring of a string $T$ is a string obtained by removing zero or more characters from the beginning and the end of $T$.

For example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.

Constraints

• $2 \leq N \leq 10^5$
• $1 \leq Q \leq 10^5$
• $S$ is a string of length $N$.
• Each character in $S$ is A, C, G or T.
• $1 \leq l_i < r_i \leq N$

Input

Input is given from Standard Input in the following format:

N Q
S
l_1 r_1
:
l_Q r_Q

Output

Print $Q$ lines. The $i$-th line should contain the answer to the $i$-th query.