No tag edit access

B. Ilya and Queries

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIlya 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.

Input

The first line contains string *s* of length *n* (2 ≤ *n* ≤ 10^{5}). It is guaranteed that the given string only consists of characters "." and "#".

The next line contains integer *m* (1 ≤ *m* ≤ 10^{5}) — 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*).

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

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/23/2017 15:40:04 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|