import java.util.*;
import java.lang.*;

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[] l = new int[q];
		int[] r = new int[q];
		for (int i = 0; i < q; i++) {
			l[i] = sc.nextInt() - 1;
			r[i] = sc.nextInt() - 1;
		}
		Set<Integer> set = new TreeSet<>();
		int[] sum = new int[n];
		int count = 0;
		for (int i = 0; i < n - 1; i++) {
			if (s.substring(i, i + 2).equals("AC")) {
				count++;
				set.add(i);
			}
			sum[i] = count;
		}
		sum[n - 1] = count;
		for (int i = 0; i < q; i++) {
			if (set.contains(r[i])) {
				if (set.contains(l[i])) {
					System.out.println(sum[r[i]] - 1 - sum[l[i]] + 1);
				} else {
					System.out.println(sum[r[i]] - 1 - sum[l[i]]);
				}
			} else {
				if (set.contains(l[i])) {
					System.out.println(sum[r[i]] - sum[l[i]] + 1);
				} else {
					System.out.println(sum[r[i]] - sum[l[i]]);
				}
			}
		}
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz