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.*;

public class Main {
	
	public static void main(String[] args)  {
		Scanner scan = new Scanner(System.in);
		int n=Integer.parseInt(scan.next());
		int q=Integer.parseInt(scan.next());
		String s=scan.next();
		int[] count=new int [n];
		Arrays.fill(count, 0);
		//累積和
		for (int i=1;i<n;++i) {
			if (s.charAt(i-1)=='A'&&s.charAt(i)=='C') {
					count[i]=count[i-1]+1;			
				}
			else {
				count[i]=count[i-1];
			}
		}
		
		int l,r;
		int[] ans =new int [q];
		for (int i=0;i<q;++i) {
			l=Integer.parseInt(scan.next());
			r=Integer.parseInt(scan.next());
			ans[i]=count[r-1]-count[l-1];
			
		}
		
		for (int i=0;i<q;++i) {
			System.out.println(ans[i]);
		}
		
	
}
}
//end
