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:
s = input()
m = int(input())
q = [[int(j) for j in input().split()] for z in range(m)]
# a = [[0 for _ in range(2)]]
# a[0][0] = 1
# k = 0
# c = 1
# p = [0] * len(s)
# for i in range(0, len(s) - 1):
#     if s[i] == s[i + 1]:
#         c += 1
#         p[i] = k
#     else:
#         p[i] = k
#         a[k][1] = a[k][0] + c - 1
#         a.append([])
#         k += 1
#         a[k].append(a[k - 1][1] + 1)
#         a[k].append(0)
#         c = 1
#     if i == len(s) - 2 and s[i] == s[i + 1]:
#         a[k][1] = a[k][0] + c - 1
#         p[i + 1] = k
# if s[len(s) - 1] != s[len(s) - 2]:
#     a[k][1] = a[k][0]
#     p[len(s) - 1] = k
count = [0] * len(s)
for i in range(len(s) - 1):
    if s[i] == s[i + 1]:
        count[i + 1] = count[i] + 1
    else:
        count[i + 1] = count[i]
for i in range(m):
    print(count[q[i][1] - 1] - count[q[i][0] - 1])
# for i in range(m):
    # l = q[i][0] - 1
    # r = q[i][1] - 1
    # if p[l] == p[r]:
    #     print(r - l)
    #     continue
    # sum = a[p[l]][1] - l
    # for j in range(p[l] + 1, p[r]):
    #     sum += a[j][1] - a[j][0]
    # sum += r - a[p[r]][0]
    # print(sum)