import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();

            int s[] = new int[N + 1];
            int count = 0;
            for (int i = 2; i <= N; i++) {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            }

            for (int i = 0; i < Q; i++) {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            }
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();

            int s[] = new int[N + 1];
            int count = 0;
            for (int i = 2; i <= N; i++) {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            }

            for (int i = 0; i < Q; i++) {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            }
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) TaskC solver = new TaskC(); solver new TaskC() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();

            int s[] = new int[N + 1];
            int count = 0;
            for (int i = 2; i <= N; i++) {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            }

            for (int i = 0; i < Q; i++) {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            }
        }

    } TaskC public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();

            int s[] = new int[N + 1];
            int count = 0;
            for (int i = 2; i <= N; i++) {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            }

            for (int i = 0; i < Q; i++) {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            }
        } solve {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();

            int s[] = new int[N + 1];
            int count = 0;
            for (int i = 2; i <= N; i++) {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            }

            for (int i = 0; i < Q; i++) {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            }
        } int N = in.nextInt(); N in.nextInt() in.nextInt in int Q = in.nextInt(); Q in.nextInt() in.nextInt in String S = in.next(); S in.next() in.next in int s[] = new int[N + 1]; s new int[N + 1] N + 1 N 1 int count = 0; count 0 for (int i = 2; i <= N; i++) {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            } int i = 2; int i = 2; i 2 i <= N i N i++ i++ i {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            } {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            } if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                } S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A' S.charAt(i - 1) == 'C' S.charAt(i - 1) S.charAt S i - 1 i 1 'C' S.charAt(i - 2) == 'A' S.charAt(i - 2) S.charAt S i - 2 i 2 'A' {
                    count++;
                } count++ count s[i] = count s[i] s i count for (int i = 0; i < Q; i++) {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            } int i = 0; int i = 0; i 0 i < Q i Q i++ i++ i {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            } {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            } int l = in.nextInt(); l in.nextInt() in.nextInt in int r = in.nextInt(); r in.nextInt() in.nextInt in out.println(s[r] - s[l]) out.println out s[r] - s[l] s[r] s r s[l] s l int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();

            int s[] = new int[N + 1];
            int count = 0;
            for (int i = 2; i <= N; i++) {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            }

            for (int i = 0; i < Q; i++) {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            }
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();

            int s[] = new int[N + 1];
            int count = 0;
            for (int i = 2; i <= N; i++) {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            }

            for (int i = 0; i < Q; i++) {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            }
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();

            int s[] = new int[N + 1];
            int count = 0;
            for (int i = 2; i <= N; i++) {
                if (S.charAt(i - 1) == 'C' && S.charAt(i - 2) == 'A') {
                    count++;
                }
                s[i] = count;
            }

            for (int i = 0; i < Q; i++) {
                int l = in.nextInt();
                int r = in.nextInt();
                out.println(s[r] - s[l]);
            }
        }

    }
}

