import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class CGeTAC {
        static final char A = 'A';
        static final char C = 'C';

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), q = in.nextInt();

            char[] s = (in.next()).toCharArray();

            int[] count = new int[n];
            for (int i = 0; i < n; i++) {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            }

            for (int i = 0; i < q; i++) {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}
 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.StringTokenizer; StringTokenizer java.util import java.io.IOException; IOException java.io import java.io.BufferedReader; BufferedReader java.io import java.io.InputStreamReader; InputStreamReader java.io import java.io.InputStream; InputStream java.io public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CGeTAC solver = new CGeTAC();
        solver.solve(1, in, out);
        out.close();
    }

    static class CGeTAC {
        static final char A = 'A';
        static final char C = 'C';

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), q = in.nextInt();

            char[] s = (in.next()).toCharArray();

            int[] count = new int[n];
            for (int i = 0; i < n; i++) {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            }

            for (int i = 0; i < q; i++) {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CGeTAC solver = new CGeTAC();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CGeTAC solver = new CGeTAC();
        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 InputReader in = new InputReader(inputStream); in new InputReader(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) CGeTAC solver = new CGeTAC(); solver new CGeTAC() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class CGeTAC {
        static final char A = 'A';
        static final char C = 'C';

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), q = in.nextInt();

            char[] s = (in.next()).toCharArray();

            int[] count = new int[n];
            for (int i = 0; i < n; i++) {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            }

            for (int i = 0; i < q; i++) {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            }
        }

    } CGeTAC static final char A = 'A'; A 'A' static final char C = 'C'; C 'C' public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), q = in.nextInt();

            char[] s = (in.next()).toCharArray();

            int[] count = new int[n];
            for (int i = 0; i < n; i++) {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            }

            for (int i = 0; i < q; i++) {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            }
        } solve {
            int n = in.nextInt(), q = in.nextInt();

            char[] s = (in.next()).toCharArray();

            int[] count = new int[n];
            for (int i = 0; i < n; i++) {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            }

            for (int i = 0; i < q; i++) {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            }
        } int n = in.nextInt() n in.nextInt() in.nextInt in q = in.nextInt(); q in.nextInt() in.nextInt in char[] s = (in.next()).toCharArray(); s (in.next()).toCharArray() (in.next()).toCharArray (in.next()) in.next in int[] count = new int[n]; count new int[n] n for (int i = 0; i < n; i++) {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            } {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            } count[i] = i > 0 ? count[i - 1] : 0 count[i] count i i > 0 ? count[i - 1] : 0 i > 0 i 0 count[i - 1] count i - 1 i 1 0 if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                } i > 0 && s[i - 1] == A && s[i] == C i > 0 && s[i - 1] == A && s[i] == C i > 0 i 0 s[i - 1] == A s[i - 1] s i - 1 i 1 A s[i] == C s[i] s i C {
                    count[i]++;
                } count[i]++ count[i] count i for (int i = 0; i < q; i++) {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            } int i = 0; int i = 0; i 0 i < q i q i++ i++ i {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            } {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            } int l = in.nextInt() - 1 l in.nextInt() - 1 in.nextInt() in.nextInt in 1 r = in.nextInt() - 1; r in.nextInt() - 1 in.nextInt() in.nextInt in 1 int answer = count[r] - count[l]; answer count[r] - count[l] count[r] count r count[l] count l out.println(answer) out.println out answer int testNumber testNumber InputReader in in PrintWriter out out static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    } InputReader public BufferedReader reader; reader public StringTokenizer tokenizer; tokenizer public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        } InputReader {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        } reader = new BufferedReader(new InputStreamReader(stream), 32768) reader new BufferedReader(new InputStreamReader(stream), 32768) tokenizer = null tokenizer null InputStream stream stream public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        } next {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        } while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            } tokenizer == null || !tokenizer.hasMoreTokens() tokenizer == null tokenizer null !tokenizer.hasMoreTokens() tokenizer.hasMoreTokens() tokenizer.hasMoreTokens tokenizer {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            } try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                } IOException e {
                    throw new RuntimeException(e);
                } throw new RuntimeException(e); new RuntimeException(e) {
                    tokenizer = new StringTokenizer(reader.readLine());
                } tokenizer = new StringTokenizer(reader.readLine()) tokenizer new StringTokenizer(reader.readLine()) return tokenizer.nextToken(); tokenizer.nextToken() tokenizer.nextToken tokenizer public int nextInt() {
            return Integer.parseInt(next());
        } nextInt {
            return Integer.parseInt(next());
        } return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CGeTAC solver = new CGeTAC();
        solver.solve(1, in, out);
        out.close();
    }

    static class CGeTAC {
        static final char A = 'A';
        static final char C = 'C';

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), q = in.nextInt();

            char[] s = (in.next()).toCharArray();

            int[] count = new int[n];
            for (int i = 0; i < n; i++) {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            }

            for (int i = 0; i < q; i++) {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

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

    static class CGeTAC {
        static final char A = 'A';
        static final char C = 'C';

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), q = in.nextInt();

            char[] s = (in.next()).toCharArray();

            int[] count = new int[n];
            for (int i = 0; i < n; i++) {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            }

            for (int i = 0; i < q; i++) {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class CGeTAC {
        static final char A = 'A';
        static final char C = 'C';

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), q = in.nextInt();

            char[] s = (in.next()).toCharArray();

            int[] count = new int[n];
            for (int i = 0; i < n; i++) {
                count[i] = i > 0 ? count[i - 1] : 0;
                if (i > 0 && s[i - 1] == A && s[i] == C) {
                    count[i]++;
                }
            }

            for (int i = 0; i < q; i++) {
                int l = in.nextInt() - 1, r = in.nextInt() - 1;

                int answer = count[r] - count[l];

                out.println(answer);
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

