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* = *s*<sub class="lower-index">1</sub>*s*<sub class="lower-index">2</sub>... *s*<sub class="lower-index">*n*</sub> (*n* is the length of the string), consisting only of characters "." and "#" and *m* queries. Each query is described by a pair of integers *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> &lt; *r*<sub class="lower-index">*i*</sub> ≤ *n*). The answer to the query *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> is the number of such integers *i* (*l*<sub class="lower-index">*i*</sub> ≤ *i* &lt; *r*<sub class="lower-index">*i*</sub>), that *s*<sub class="lower-index">*i*</sub> = *s*<sub class="lower-index">*i* + 1</sub>.

Ilya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.
The first line contains string *s* of length *n* (2 ≤ *n* ≤ 10<sup class="upper-index">5</sup>). It is guaranteed that the given string only consists of characters "." and "#".

The next line contains integer *m* (1 ≤ *m* ≤ 10<sup class="upper-index">5</sup>) — the number of queries. Each of the next *m* lines contains the description of the corresponding query. The *i*-th line contains integers *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> &lt; *r*<sub class="lower-index">*i*</sub> ≤ *n*).
import math
def error(*n):
    print("[Err]",end=" ")
    for i in n:
        print(i,end=" ")
    print()

s = input()

##n = [int(i) for i in input().split()]
##if type(n) == list:
##    n = n[0]

dif = [i+1 for i in range(len(s)-1) if s[i]!=s[i+1]]

def bs(x):
    l=0
    r=len(dif)-1
    ret = -1
    while l<=r:
        mid = int((l+r)/2)
        if (dif[mid]<=x):
            ret = mid
            l=mid+1
        else:
            r=mid-1
    return ret+1

for i in range(int(input())):
    lq,rq = [int(i) for i in input().split()]
    ans = rq-lq-bs(rq-1)+bs(lq-1)
    print(ans)

			 	 	     			   								    	