Problem: Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.

You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m queries. Each query is described by a pair of integers li, ri (1 ≤ li < ri ≤ n). The answer to the query li, ri is the number of such integers i (li ≤ i < ri), that si = si + 1.

Ilya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.

Input

The first line contains string s of length n (2 ≤ n ≤ 105). It is guaranteed that the given string only consists of characters "." and "#".

The next line contains integer m (1 ≤ m ≤ 105) — the number of queries. Each of the next m lines contains the description of the corresponding query. The i-th line contains integers li, ri (1 ≤ li < ri ≤ n).

Output

Print m integers — the answers to the queries in the order in which they are given in the input.

Examples

Input

......
4
3 4
2 3
1 6
2 6


Output

1
1
5
4


Input

#..###
5
1 3
5 6
1 5
3 6
3 4


Output

1
1
2
2
0

Solution (in PYTHON3):

Solution:
from sys import stdin, stdout
# import timeit


class QueryCalculator:
  
  def __init__(self, database):
    self.smart_coincidences = QueryCalculator.build_smart_coincidences(database)

  def build_smart_coincidences(database):
    smart_coincidences = []
    for i in range(len(database) - 1):
      first_char = database[i]
      next_char = database[i+1]
      weight = 0
      if first_char == next_char:
        weight = 1
      previous_weight = 0
      if len(smart_coincidences) != 0:
        previous_weight = smart_coincidences[-1]
      smart_coincidences.append(previous_weight + weight)
    
    return smart_coincidences

  def get_weight(self, query):
    left_weight = 0
    if query.left - 1 >= 0:
      left_weight = self.smart_coincidences[query.left - 1]
    right_weight = self.smart_coincidences[query.right - 1]
    return right_weight - left_weight
      
    
class Query:
  def __init__(self, left, right):
    self.left = left - 1
    self.right = right - 1

def smart_solve(database, queries_count, queries):
  result = []
  calculator = QueryCalculator(database)
  for i in range(queries_count):
    query = queries[i]
    weight = calculator.get_weight(query)
    result.append(weight)
  return result


database = stdin.readline().rstrip("\r\n")
queries_count = int(stdin.readline())
queries = []
for i in range(queries_count):
  lst = [ int(x) for x in stdin.readline().rstrip("\r\n").split() ]
  query = Query(lst[0], lst[1])
  queries.append(query)

lst = smart_solve(database, queries_count, queries)

for result in lst:
  stdout.write(str(result))
  stdout.write("\n")



# def wrapper(func, *args, **kwargs):
#   def wrapped():
#     return func(*args, **kwargs)
#   return wrapped

# database = '#..###'
# queries_count = 5
# queries = [Query(1,3), Query(5,6), Query(1,5), Query(3,6), Query(3,4)]
# wrapped1 = wrapper(smart_solve, database, queries_count, queries);
# print(timeit.timeit(wrapped1))