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 JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class Solution {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String str = br.readLine();
		int n = Integer.parseInt(br.readLine());
		List<Query> queries = new ArrayList<>();
		StringTokenizer st = null;
		for (int i = 0; i < n; i++) {
			st = new StringTokenizer(br.readLine());
			int li = Integer.parseInt(st.nextToken());
			int ri = Integer.parseInt(st.nextToken());
			queries.add(new Query(li, ri));
		}
		List<Integer> result = solve(str, n, queries);
		for (int i = 0; i < result.size(); i++)
			System.out.println(result.get(i));

	}

	private static List<Integer> solve(String str, int n, List<Query> queries) {

		List<Integer> result = new ArrayList<>();
		int[] dp = new int[str.length()];
		int sum = 0;

		// create dp memory
		for (int i = 0; i < str.length() - 1; i++) {
			if (str.charAt(i) == str.charAt(i + 1))
				sum++;
			dp[i + 1] = sum;
		}

		// calculate each query result
		for (Query q : queries) {
			int li = q.li - 1;
			int ri = q.ri - 1;
			result.add(dp[ri] - dp[li]);
		}
		return result;
	}
}

class Query {
	public int li;
	public int ri;

	public Query(int li, int ri) {
		this.li = li;
		this.ri = ri;
	}
}