Problem: 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

Solution (in CPP):

Solution:
#include<iostream>
#include<vector>

using namespace std;

int main(void){
  int N,Q,l,r;
  string s;
  int  ans;
  cin >> N >> Q >> s;
  vector<int> a(N,0);

  int b = 0;
  for (int i = 1; i < N; i++){
    if(s[i-1] == 'A' && s[i] =='C')b++;
    a[i] = b;
  }
  for ( int i = 0; i < Q; i++ ){
    cin >> l >> r;
    cout << ( a[r-1] - a[l-1] ) << endl;
  }

}