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

public class test {

	
	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		
		char[] arr = new char[100001];
		int[] arr2 = new int[100001];
		String s = scan.next();
		
		for(int i=0;i<s.length();i++) {
			arr[i] = s.charAt(i);
		}
		for(int i=0;i<s.length();i++) {
			if(i==0) {
				if(arr[0]==arr[1])arr2[0]=1;
				else arr2[0]=0;
			}
			else {
				if(arr[i]==arr[i+1]) {
					arr2[i] = arr2[i-1]+1;
				}
				else arr2[i] = arr2[i-1];
			}
			
		}
//		for(int i=0;i<10;i++) {
//			System.out.print(arr2[i]);
//		}
		int m = scan.nextInt();
		for(int i=0;i<m;i++) {
			int k=scan.nextInt();
			int l = scan.nextInt();
			
//			for(int j=k-1;j<l-1;j++) {
//				count +=arr2[j];
//			}
			if(k==1) {
				System.out.println(arr2[l-2]);
				continue;
			}
			System.out.println(arr2[l-2]-arr2[k-2]);
			
		}
		
	}	

}