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

public class Ilya2{

	static int n = 1; // def value

	public static void main(String[] args){

		MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));

		String s = sc.nextLine();
		// print(s);
		n = sc.nextInt();
		// print(n);

		boolean[] arr = new boolean[s.length() + 5];
		for(int i = 1; i < s.length(); i++){
			if(s.charAt(i) == s.charAt(i-1)){
				arr[i-1] = true;
			} // else default is false
		}

		int[] sigma = new int[s.length() + 5]; // running sum
		//if(arr[0]){
		//	sigma[0] = 1;
		//}
		for(int i = 1; i < s.length(); i++){
			sigma[i] = arr[i-1] ? sigma[i-1] + 1 : sigma[i-1];
		}

		// print(Arrays.toString(arr));
		// print(Arrays.toString(sigma));

		for(int i = 0; i < n; i++){
			int a = sc.nextInt() - 1;
			int b = sc.nextInt() - 1;
			print(sigma[b] - sigma[a]);
		}

		
	}

	public static void print(Object x){
		System.out.println(x.toString());
		// out.println(x.toString());
	}


	//-----------PrintWriter for faster output---------------------------------
   public static PrintWriter out;
      
   //-----------MyScanner class for faster input----------
   public static class MyScanner {
      BufferedReader br;
      StringTokenizer st;
 
      public MyScanner() {
         br = new BufferedReader(new InputStreamReader(System.in));
      }
 
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
 
      int nextInt() {
          return Integer.parseInt(next());
      }
 
      long nextLong() {
          return Long.parseLong(next());
      }
 
      double nextDouble() {
          return Double.parseDouble(next());
      }
 
      String nextLine(){
          String str = "";
	  try {
	     str = br.readLine();
	  } catch (IOException e) {
	     e.printStackTrace();
	  }
	  return str;
      }

   }
   //--------------------------------------------------------

}