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 PYTHON):

Solution:

def get(arr, i):
  try:
    return arr[i] if i >= 0 else 0
  except IndexError:
    return 0


string = raw_input()
n = int(raw_input())
qs = []
for i in range(n):
  qs.append([int(i) for i in raw_input().split(' ')])

dp = [0] * (len(string)-1)
num = 0
for i in range(len(string)-1):
  dp[i] = int(string[i] == string[i+1])
dp += [0]

s, dpi = 0, [0] * (len(string))
for i in range(len(string)):
  s += dp[i]
  dpi[i] = s

s, dpe = 0, [0] * (len(string))
for i in reversed(range(len(string))):
  s += dp[i]
  dpe[i] = s

for q in qs:
    print dpe[0]  - get(dpi, q[0]-2) - get(dpe, q[1]-1)
    #print sum(dp[q[0]-1:q[1]-1])