ABC122 C-GeT AC

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≤i≤Q): You will be given integers l i  and r i  (1≤l i <r i ≤N). Consider the substring of S starting at index l i  and ending at index ri  (both inclusive). In this string, how many times does AC occurs as a substring?

Notes

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≤N≤10 5

 1≤Q≤10 5

S is a string of length N.

Each character in S is A, C, G or T.

1≤l i <r i ≤N

Input

Input is given from Standard Input in the following format:

Output

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

Sample Input 1

8 3

ACACTACG

3 7

2 3

1 8

Sample Output 1

2

0

3

Query

1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.

Query

2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.

Query

3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.

---------

用处理字符串的方式, 制作一个前缀和数组也就是AC出现的次数, 这样就可以不超时的输出了.