output_description: Print Q lines. The i-th line should contain the answer to the i-th query.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N Q
      S
      l_1 r_1
      :
      l_Q r_Q
attempt: n, q = map(int, input().split())
  l = [0 for i in range(n)]
  for i, v in enumerate(list(input().replace("AC", "X!"))):
      l[i] = l[i - 1] + (v == "!")
  print(l)
  for c in range(q):
      h, m = map(int, input().split())
      print(l[m - 1] - l[max(h - 2, 0)])
  
problem_description: Statement
  
  You are given a string S of length N consisting of `A`, `C`, `G` and `T`.
  Answer the following Q queries:
  
    * Query i (1 \leq i \leq Q): You will be given integers l_i and r_i (1 \leq l_i < r_i \leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does `AC` occurs as a substring?
samples: [{"input": "8 3\n    ACACTACG\n    3 7\n    2 3\n    1 8", "output": "2\n    0\n    3\n    \n\n  * Query 1: the substring of S starting at index 3 and ending at index 7 is `ACTAC`. In this string, `AC` occurs twice as a substring.\n  * Query 2: the substring of S starting at index 2 and ending at index 3 is `CA`. In this string, `AC` occurs zero times as a substring.\n  * Query 3: the substring of S starting at index 1 and ending at index 8 is `ACACTACG`. In this string, `AC` occurs three times as a substring."}]