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:
# -*- coding: utf-8 -*-
"""
Created on Mon Dec 19 20:03:06 2016

@author: Chandak
"""

r = lambda : map(int, raw_input().split())

a = raw_input()

# Pre-processing to create prefix array 
# or dp array in O(n) time 

dp = [0]
for i in xrange(0, len(a)-1):
    if a[i] == a[i+1]:
        dp.append(dp[i]+1)
    else :
        dp.append(dp[i])
dp.append(0)
        
# Just to check / ensure 
#print dp

# Answering Queries 
# Queries = 1 <= m <= 10^5
# Since we will do only constant work per query 
# Hence, Answering Queries = 
# O(m) or O(n) as n <= 10^5

q = r()[0]
for _ in xrange(q):
    lq, rq = r()
    print dp[rq - 1] - dp[lq - 1]