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
import java.util.Scanner;

class Main{
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int q = sc.nextInt();
		String str = sc.next();
		int a[] = new int[n];
		int x = 0;
		boolean hantei = false;
		
		for(int i = 0; i < n; i++){
			char c = str.charAt(i);
			if(c == 'A'){
				a[i] = x;
				hantei = true;
			}else if(hantei && (c == 'C')){
				x += 1;
				a[i] = x;
				hantei = false;
			}else{
				a[i] = x;
				hantei = false;
			}
		}
		
		for(int i = 0; i < q; i++){
			int kekka = 0;
			int l = sc.nextInt();
			int r = sc.nextInt();
			kekka = a[r-1] - a[l-1];
			System.out.println(kekka);
		}
	}
}