CF313B.Ilya and Queries

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_1_s_2... s__n (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__i, r__i (1 ≤ l__i < r__i ≤ n). The answer to the query l__i, r__i is the number of such integers i (l__i ≤ i < r__i), that s__i = s__i + 1.

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

狮子伊利亚想帮助他所有的朋友通过考试。他们需要解决以下问题才能通过信息技术考试。

给定一个字符串 $s = s_1 s_2 \dots s_n$（$n$ 为字符串长度），该字符串仅由字符 . 和 # 组成，以及 $m$ 个查询。每个查询由一对整数 $l_i,\, r_i$ 描述（满足 $1 \leq l_i < r_i \leq n$）。对于查询 $l_i,\, r_i$，其答案为满足 $l_i \leq i < r_i$ 且 $s_i = s_{i+1}$ 的整数 $i$ 的个数。

狮子伊利亚想帮助他的朋友们，但谁来帮他呢？请帮助伊利亚解决这个问题。

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 l__i, r__i (1 ≤ l__i < r__i ≤ n).

第一行包含一个长度为 $n$ 的字符串 $s$（$2 \leq n \leq 10^5$）。保证该字符串仅由字符 “.” 和 “#” 组成。

第二行包含一个整数 $m$（$1 \leq m \leq 10^5$）—— 查询的个数。接下来的 $m$ 行，每行描述一个对应的查询。第 $i$ 行包含两个整数 $l_i$、$r_i$（$1 \leq l_i < r_i \leq n$）。

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

输出 m 个整数——即按输入中给出的顺序，各查询对应的答案。