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;

public class Main {

    // split de array
    public static int[] atoi(String cad) {
        String read[] = cad.split(" ");
        int res[] = new int[ read.length ];
        for (int i = 0; i < read.length; i++) {
            res[i] = Integer.parseInt(read[i]);
        }
        return res;
    }

    // split de String
    public static String[] atos(String cad) {
        return cad.split(" ");
    }

    // parsing de String a int
    public static int parseo(String cad, int index) {
        return Integer.parseInt(cad.split(" ")[index]);
    }

    // memory status
    static String memoryStatus() {
        return (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory() >> 20) + "/"
                + (Runtime.getRuntime().totalMemory() >> 20) + " MB";
    }

    // imprimir array
    static void printArrayInt(int[] array) {
        if (array == null || array.length == 0)
            return;
        for (int i = 0; i < array.length; i++) {
            if (i > 0)
                System.out.print(" ");
            System.out.print(array[i]);
        }
        System.out.println();
    }

    // impresion de datos
    static void print(Object... obj) {
        for (int i = 0; i < obj.length; i++) {
            if (i != 0)
                System.out.print(" ");
            System.out.print(obj[i]);
        }
        System.out.println();
    }

    public static int arr[];

    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

        String line;
        ;

        while ((line = in.readLine()) != null) {
            StringBuilder br = new StringBuilder();
            char cad[] = line.toCharArray();
            int n = Integer.parseInt(in.readLine());
            arr = new int[ cad.length ];
            for (int i = 1; i < cad.length; i++) {
                if (cad[i] == cad[i - 1]) {
                    arr[i] = arr[i - 1] + 1;
                } else {
                    arr[i] = arr[i - 1];
                }
            }
            for (int i = 0; i < n; i++) {
                int dates[] = atoi(in.readLine());
                br.append(arr[dates[1]-1] - arr[dates[0]-1]).append("\n");
            }
            System.out.print(br+"");
        }
    }

}