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.InputStreamReader;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.Reader;
import java.util.StringTokenizer;

public class Main {

    static class IO {
        
        BufferedReader reader;
        StringTokenizer st;

        public IO(Reader reader) {
            this.reader = new BufferedReader(reader);
        }

        public String next() {
            while (this.st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(this.reader.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(this.next());
        }

        public double nextDouble() {
            return Double.parseDouble(this.next());
        }

        public char nextChar() {
            return this.next().toCharArray()[0];
        }

        public String nextLine() {
            try {
                return reader.readLine();
            } catch (Exception e) {
                e.printStackTrace();
            }

            return "";
        }

    }
    
    static int[] dp;
    
    
    public static void main(String[] args) {
        
        IO in = new IO(new InputStreamReader(System.in));
        
        String s = in.nextLine();
        dp = new int[s.length() + 1];
        
        int sum = 0;
        for(int i = 2; i <= s.length(); i++){
            if(s.charAt(i - 2) == s.charAt(i-1))
                sum++;
            dp[i] = sum;
        }
 
                
        
        int n = in.nextInt();
        for(int i = 0; i < n;i++){
             int start = in.nextInt();
             int end = in.nextInt();
             System.out.println(dp[end] - dp[start]);
        }
        
        
    }
}