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


public class IIyaQueries {

    
    static int[] sum;
    static int [] equals;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String s = br.readLine();
        StringBuilder sb = new StringBuilder();
        int len = s.length();
        int n = Integer.parseInt(br.readLine());
        int l[] = new int[n];
        int r[] = new int[n];
        equals = new int[len];
        for(int i=0; i<s.length()-1; i++){
            if(s.charAt(i)==s.charAt(i+1))
                equals[i] = 1;
        }
        sum = new int[len];
        Arrays.fill(sum, -1);
        //System.out.println(Arrays.toString(equals));
        //System.out.println(Arrays.toString(sum));
        
        for(int i=0; i<n; i++){
            StringTokenizer st = new StringTokenizer(br.readLine());
            l[i] = Integer.parseInt(st.nextToken())-1;
            r[i] = Integer.parseInt(st.nextToken())-1;
            if(l[i]==0){
                int s1 = getSum(r[i]-1);
                sb.append(s1+"\n");
            }
            else{
                int s1 = getSum(r[i]-1);
                int s2 = getSum(l[i]-1);
                sb.append(s1 - s2+"\n");
            }
        }
        
        System.out.print(sb);
    }

    private static int getSum(int i) {
        if(sum[i]!=-1)
            return sum[i];
        if(i==0){
            sum[i]=equals[i];
            return equals[i];
        }
        sum[i] = equals[i]+getSum(i-1);
        
        return sum[i];
    }
    

}