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[] l = new int[Q];
    int[] r = new int[Q];
    for (int i = 0; i < Q; i++) {
      l[i] = sc.nextInt();
      r[i] = sc.nextInt();
    }
    Main abc122C = new Main();
    abc122C.solve(S, N, Q, l, r);
  }

  public void solve(String S, int N, int Q, int[] l, int[] r) {
    int[] dp = new int[N];
    for (int i = 0; i < N - 1; i++) {
      if (S.charAt(i) == 'A' && S.charAt(i + 1) == 'C') {
        dp[i + 1] = dp[i] + 1;
      } else {
        dp[i + 1] = dp[i];
      }
    }
    for (int i = 0; i < Q; i++) {
      System.out.println(dp[r[i]-1] - dp[l[i]-1]);
    }
  }
}

/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