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.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.StreamTokenizer;
import java.io.Writer;
import java.util.Scanner;

public class Tmp {
    private static Reader reader = new InputStreamReader(System.in);
    private static Writer writer = new OutputStreamWriter(System.out);
    private static StreamTokenizer in = new StreamTokenizer(new BufferedReader(reader));
    private static PrintWriter out = new PrintWriter(writer);

    private static int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }

    private static String nextString() throws IOException {
        in.nextToken();
        return in.sval;
    }

    public static void main(String[] args) throws IOException {
        Scanner scan = new Scanner(System.in);
        String s = scan.next();
        int n = scan.nextInt();
        int[] sum = new int[s.length()];
        for (int i = 1; i < s.length(); i++) {
            if (s.charAt(i) == s.charAt(i - 1)) {
                sum[i] = sum[i - 1] + 1;
            } else {
                sum[i] = sum[i - 1];
            }
        }

        int k, l;
        for (int i = 0; i < n; i++) {
            k = scan.nextInt() - 1;
            l = scan.nextInt() - 1;
            out.println(sum[l] - sum[k]);
        }

        out.flush();
    }


    public static int[] solve(String s, int[][] a) {
        int[] res = new int[a.length];

        int sum = 0;
        for (int i = 0; i < a.length; i++) {
            for (int j = a[i][0]; j < a[i][1] && j < s.length(); j++) {
                if (s.charAt(j - 1) == s.charAt(j)) {
                    sum++;
                }
            }
            res[i] = sum;
            sum = 0;
        }

        return res;
    }


}