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 JAVA):

Solution:
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int Q = sc.nextInt();

		String S = sc.next();

		int[] kukan = new int[2*Q];
		for(int i = 0 ; i < 2*Q ; i++){
			kukan[i] = sc.nextInt()-1;
		}
		sc.close();

		int[] AC = new int[N];


		int count = 0;
		for(int i = 0 ; i < N-1 ; i++){
			if(S.substring(i, i+1).equals("A") && S.substring(i+1, i+2).equals("C")){
				count++;
			}
			AC[i+1] = count;
		}

/*
		for(int i = 0 ; i < N ; i++){
			System.out.println(AC[i]);
		}
*/
		for(int i = 0 ; i < 2*Q ; i+=2){
				System.out.println(AC[kukan[i+1]] - AC[kukan[i]]);
		}



	}
}