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


public class Codeforces {


    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        String s = Reader.next();
        int dp[] = new int[s.length()]; 
        
        for(int i = 1; i < dp.length; i++){
            dp[i] = dp[i - 1];
            dp[i] += (s.charAt(i) == s.charAt(i - 1)) ? 1 : 0;
        }
        
        int m = Reader.nextInt();
        for(int i = 0; i < m; i++){
            int a = Reader.nextInt(), b = Reader.nextInt();
            System.out.println(dp[b - 1] - dp[a - 1]);
        }
    }
    
}
class Arr implements Comparable<Arr>{

        long val;
        int index;
        
        @Override
        public int compareTo(Arr t) {
            if(t.val > this.val)
                return 1;
            if(t.val < this.val)
                return -1;
            else
                return 0;
        }
        
        public Arr(long val, int index){
            this.val = index;
            this.index = index;
        }
}


class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    /**
     * call this method to initialize reader for InputStream
     */
    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    /**
     * get next word
     */
    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

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

    static byte nextByte() throws IOException {
        return Byte.parseByte(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

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