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.util.Scanner;

public class IlyaAndQueries {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		String s=sc.nextLine();
		int n=s.length();
		int m=sc.nextInt();
		int[] q_start=new int[m];
		int[] q_end=new int[m];
		for(int i=0;i<m;i++) {
			q_start[i]=sc.nextInt();
			q_end[i]=sc.nextInt();
		}
		int[] dp=new int[n+1];
		dp[0]=0;
		dp[1]=0;
		for(int i=2;i<=n;i++) {
			if(s.charAt(i-1)==s.charAt(i-2)) {
				dp[i]=dp[i-1]+1;
			}
			else {
				dp[i]=dp[i-1];
			}
		}
//		System.out.println("DP IS ");
//		for(int x:dp){
//			System.out.print(x);
//		}
		//System.out.println();
		for(int i=0;i<m;i++) {
			int start=q_start[i];
			int end=q_end[i];
			int ans=0;
			ans=dp[end]-dp[start];
			System.out.println(ans);
		}
		
		sc.close();
	}
	
}