import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.List;
import java.util.Scanner;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author teiwa
 */
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 {
        String AC_STRING = "AC";

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();
            int[] startArray = new int[Q];
            int[] endArray = new int[Q];
            for (int i = 0; i < Q; i++) {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            }

            List<Integer> countSum = new ArrayList<>();
            for (int i = 0; i < AC_STRING.length() - 1; i++) {
                countSum.add(0);
            }
            // make pos list

            String target = S;
            int counter = 0;
            for (int j = AC_STRING.length() - 1; j < target.length(); j++) {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            }
            //System.out.println(countSum);
            // count
            for (int i = 0; i < Q; i++) {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            }
        }

    }
}
 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.io.PrintStream; PrintStream java.io import java.util.List; List java.util import java.util.Scanner; Scanner java.util import java.util.ArrayList; ArrayList 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 {
        String AC_STRING = "AC";

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();
            int[] startArray = new int[Q];
            int[] endArray = new int[Q];
            for (int i = 0; i < Q; i++) {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            }

            List<Integer> countSum = new ArrayList<>();
            for (int i = 0; i < AC_STRING.length() - 1; i++) {
                countSum.add(0);
            }
            // make pos list

            String target = S;
            int counter = 0;
            for (int j = AC_STRING.length() - 1; j < target.length(); j++) {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            }
            //System.out.println(countSum);
            // count
            for (int i = 0; i < Q; i++) {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            }
        }

    }
} 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 {
        String AC_STRING = "AC";

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();
            int[] startArray = new int[Q];
            int[] endArray = new int[Q];
            for (int i = 0; i < Q; i++) {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            }

            List<Integer> countSum = new ArrayList<>();
            for (int i = 0; i < AC_STRING.length() - 1; i++) {
                countSum.add(0);
            }
            // make pos list

            String target = S;
            int counter = 0;
            for (int j = AC_STRING.length() - 1; j < target.length(); j++) {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            }
            //System.out.println(countSum);
            // count
            for (int i = 0; i < Q; i++) {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            }
        }

    } TaskC String AC_STRING = "AC"; AC_STRING "AC" public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();
            int[] startArray = new int[Q];
            int[] endArray = new int[Q];
            for (int i = 0; i < Q; i++) {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            }

            List<Integer> countSum = new ArrayList<>();
            for (int i = 0; i < AC_STRING.length() - 1; i++) {
                countSum.add(0);
            }
            // make pos list

            String target = S;
            int counter = 0;
            for (int j = AC_STRING.length() - 1; j < target.length(); j++) {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            }
            //System.out.println(countSum);
            // count
            for (int i = 0; i < Q; i++) {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            }
        } solve {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();
            int[] startArray = new int[Q];
            int[] endArray = new int[Q];
            for (int i = 0; i < Q; i++) {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            }

            List<Integer> countSum = new ArrayList<>();
            for (int i = 0; i < AC_STRING.length() - 1; i++) {
                countSum.add(0);
            }
            // make pos list

            String target = S;
            int counter = 0;
            for (int j = AC_STRING.length() - 1; j < target.length(); j++) {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            }
            //System.out.println(countSum);
            // count
            for (int i = 0; i < Q; i++) {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            }
        } 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[] startArray = new int[Q]; startArray new int[Q] Q int[] endArray = new int[Q]; endArray new int[Q] Q for (int i = 0; i < Q; i++) {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            } int i = 0; int i = 0; i 0 i < Q i Q i++ i++ i {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            } {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            } startArray[i] = in.nextInt() startArray[i] startArray i in.nextInt() in.nextInt in endArray[i] = in.nextInt() endArray[i] endArray i in.nextInt() in.nextInt in List<Integer> countSum = new ArrayList<>(); countSum new ArrayList<>() for (int i = 0; i < AC_STRING.length() - 1; i++) {
                countSum.add(0);
            } int i = 0; int i = 0; i 0 i < AC_STRING.length() - 1 i AC_STRING.length() - 1 AC_STRING.length() AC_STRING.length AC_STRING 1 i++ i++ i {
                countSum.add(0);
            } {
                countSum.add(0);
            } countSum.add(0) countSum.add countSum 0 String target = S; target S int counter = 0; counter 0 for (int j = AC_STRING.length() - 1; j < target.length(); j++) {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            } int j = AC_STRING.length() - 1; int j = AC_STRING.length() - 1; j AC_STRING.length() - 1 AC_STRING.length() AC_STRING.length AC_STRING 1 j < target.length() j target.length() target.length target j++ j++ j {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            } {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            } if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                } target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING) target.substring(j - AC_STRING.length() + 1, j + 1).equals target.substring(j - AC_STRING.length() + 1, j + 1) target.substring target j - AC_STRING.length() + 1 j - AC_STRING.length() j AC_STRING.length() AC_STRING.length AC_STRING 1 j + 1 j 1 AC_STRING {
                    counter++;
                } counter++ counter countSum.add(counter) countSum.add countSum counter for (int i = 0; i < Q; i++) {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            } int i = 0; int i = 0; i 0 i < Q i Q i++ i++ i {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            } {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            } out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1)) out.println out countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1) countSum.get(endArray[i] - 1) countSum.get countSum endArray[i] - 1 endArray[i] endArray i 1 countSum.get(startArray[i] - 1) countSum.get countSum startArray[i] - 1 startArray[i] startArray i 1 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 {
        String AC_STRING = "AC";

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();
            int[] startArray = new int[Q];
            int[] endArray = new int[Q];
            for (int i = 0; i < Q; i++) {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            }

            List<Integer> countSum = new ArrayList<>();
            for (int i = 0; i < AC_STRING.length() - 1; i++) {
                countSum.add(0);
            }
            // make pos list

            String target = S;
            int counter = 0;
            for (int j = AC_STRING.length() - 1; j < target.length(); j++) {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            }
            //System.out.println(countSum);
            // count
            for (int i = 0; i < Q; i++) {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            }
        }

    }
} 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 {
        String AC_STRING = "AC";

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();
            int[] startArray = new int[Q];
            int[] endArray = new int[Q];
            for (int i = 0; i < Q; i++) {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            }

            List<Integer> countSum = new ArrayList<>();
            for (int i = 0; i < AC_STRING.length() - 1; i++) {
                countSum.add(0);
            }
            // make pos list

            String target = S;
            int counter = 0;
            for (int j = AC_STRING.length() - 1; j < target.length(); j++) {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            }
            //System.out.println(countSum);
            // count
            for (int i = 0; i < Q; i++) {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            }
        }

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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author teiwa
 */
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 {
        String AC_STRING = "AC";

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int Q = in.nextInt();
            String S = in.next();
            int[] startArray = new int[Q];
            int[] endArray = new int[Q];
            for (int i = 0; i < Q; i++) {
                startArray[i] = in.nextInt();
                endArray[i] = in.nextInt();
            }

            List<Integer> countSum = new ArrayList<>();
            for (int i = 0; i < AC_STRING.length() - 1; i++) {
                countSum.add(0);
            }
            // make pos list

            String target = S;
            int counter = 0;
            for (int j = AC_STRING.length() - 1; j < target.length(); j++) {
                if (target.substring(j - AC_STRING.length() + 1, j + 1).equals(AC_STRING)) {
                    counter++;
                }
                countSum.add(counter);
            }
            //System.out.println(countSum);
            // count
            for (int i = 0; i < Q; i++) {
                out.println(countSum.get(endArray[i] - 1) - countSum.get(startArray[i] - 1));
            }
        }

    }
}

