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.BufferedReader;
    import java.io.IOException;
    import java.io.InputStream;
    import java.io.InputStreamReader;
    import java.io.OutputStream;
    import java.io.PrintWriter;
    import java.io.Reader;
    import java.util.Arrays;
    import java.util.ArrayList;
    import java.util.Collections;
    import java.util.Comparator;
    import java.util.Map;
    import java.util.HashMap;
    import java.util.Set;
    import java.util.Iterator;
    import java.util.LinkedHashMap;
    import java.util.LinkedList;
    import java.util.List;
    import java.util.StringTokenizer;


    public class Main {

        public static void main(String[] args) {
            InputStream inputStream = System.in;
            OutputStream outputStream = System.out;
            InputReader  in = new InputReader (inputStream);
            PrintWriter  out = new PrintWriter (outputStream);
            Main ob = new Main();
            ob.solve(in, out);
            out.close();
            System.exit(0);
        }
        
        void solve(InputReader in, PrintWriter out){
           char[] str = in.next().toCharArray();
           int len = str.length;
           int dp[] = new int[len+2];
           
           for(int i=0; i<len-1; i++){
               if(str[i]==str[i+1]){
                   dp[i+1] = dp[i]+1;
               }else{
                   dp[i+1] = dp[i];
               }
           }
           
           int q = in.nextInt();
           out.println();
           while(q-->0){
               int l = in.nextInt();
               int r = in.nextInt();
               out.println(dp[r-1]- dp[l-1]);
           }
        }
        
        /*
            <---------------------------------------------------------------->
        */
        static class InputReader {
            public BufferedReader reader;
            public StringTokenizer tokenizer;
            public InputReader(InputStream stream) {
                reader = new BufferedReader(new InputStreamReader(stream), 32768);
                tokenizer = null;
            }
            
            public String next() {
                while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                    try {
                        tokenizer = new StringTokenizer(reader.readLine());
                    } catch (IOException e) {
                        throw new RuntimeException(e);
                    }
                }
                return tokenizer.nextToken();
            }
            
            public int nextInt() {
                return Integer.parseInt(next());
            }
            
            public long nextLong() {
                return Long.parseLong(next());
            }
            
            public double nextDouble() {
                return Double.parseDouble(next());
            }
            
            public String nextLine() {
                String str = "";
                try {
                    str = reader.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                return str;
            }
        }
    }