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?

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.

Example

Input

8 3
ACACTACG
3 7
2 3
1 8


Output

2
0
3
#include <iostream>
#include <string>

using namespace std;

int n, Q;
int a[100005];

int main(void)
{
	string s;
	cin >> n >> Q;
	cin >> s;
	s = "#" + s;
	
	for(int i = 1; i < n; i++){
		a[i] = a[i-1];
		if(s[i] == 'A' && s[i+1] == 'C') a[i]++; 
	}
	
	int l, r;
	for(int q = 0; q < Q; q++){
		cin >> l >> r;
		cout << a[r-1] - a[l-1] << endl;
	}	
	return 0;
}