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:
//package test1;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;



public class Main {
	static class cin  {  
	    static BufferedReader reader;  
	    static StringTokenizer tokenizer;  

	    static void init(InputStream input)  {  
	        reader = new BufferedReader(new InputStreamReader(input));  
	        tokenizer = new StringTokenizer("");  
	    }  

	    static String next() throws IOException {  
	        while(!tokenizer.hasMoreTokens()){  
	            String str=reader.readLine();
	            tokenizer = new StringTokenizer(str);  
	        }  
	        return tokenizer.nextToken();  
	    }  

	    static int nextInt() throws  IOException {  
	        return Integer.parseInt(next());  
	    }  

	    static double nextDouble() throws IOException{  
	        return Double.parseDouble(next());  

	    }  
	}  
     public static void main(String[] args) {  
            cin.init(System.in);  
            try {  
            	String s=cin.next();
                int n=cin.nextInt();
                int [] dp=new int[s.length()];
                int len=s.length();
                for(int i=1;i<len;i++) {
                	if(s.charAt(i-1)==s.charAt(i)) dp[i]=dp[i-1]+1;
                	else dp[i]=dp[i-1];
                }
                for(int i=1;i<=n;i++) {
                	int l=cin.nextInt();
                	int r=cin.nextInt();
                	System.out.println(dp[r-1]-dp[l-1]);
                }

            } catch (IOException e) {  
                e.printStackTrace();  
            }  
        }  
}