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

public class Solution1 {

    private final int MOD = 1000000007;

    private void solve() throws IOException {
        String s = in.next();
        s += "E";
        Node[] tree = treeBuild(s);
        int m = in.nextInt();
        for (int i = 0; i < m; i++) {
            int l = in.nextInt() - 1;
            int r = in.nextInt() - 1;
            System.out.println(RSQ(0, l, r, tree));
        }
    }

    class Node {
        int left;
        int right;
        int sum;

        @Override
        public String toString() {
            return "{" + left + ", " + right + ", " + sum + "}";
        }

        public Node(int left, int right, int sum) {
            this.left = left;
            this.right = right;
            this.sum = sum;
        }
    }

    private Node[] treeBuild(String s) {
        int k = 1;
        while (k < s.length()) {
            k *= 2;
        }
        Node[] tree = new Node[2 * k - 1];
        for (int i = 0; i < s.length() - 1; i++) {
            tree[i + k - 1] = new Node(i, i + 1, s.charAt(i) == s.charAt(i + 1) ? 1 : 0);
        }
        for (int i = s.length() - 1; i < k; i++) {
            tree[i + k - 1] = new Node(i, i + 1, 0);
        }
        for (int i = k - 2; i >= 0; i--) {
            tree[i] = new Node(tree[2 * i + 1].left, tree[2 * i + 2].right, tree[2 * i + 1].sum + tree[2 * i + 2].sum);
        }
        return tree;
    }

    private int RSQ(int node, int a, int b, Node[] tree) {
        int l = tree[node].left;
        int r = tree[node].right;
        if (l >= a && r <= b) {
            return tree[node].sum;
        }
        else if (r <= a || l >= b) {
            return 0;
        }
        return RSQ(node * 2 + 1, a, b, tree) + RSQ(node * 2 + 2, a, b, tree);
    }

    private String filename = "";
    private PrintWriter out;
    MyScanner in;

    private void run() throws IOException {
        in = new MyScanner();
        out = new PrintWriter(System.out);
        solve();
        in.close();
        out.close();
    }

    private class MyScanner {
        private BufferedReader br;
        private StringTokenizer st;

        public MyScanner() throws IOException {
            this.br = new BufferedReader(new InputStreamReader(System.in));
        }

        public MyScanner(String fileTitle) throws IOException {
            this.br = new BufferedReader(new FileReader(fileTitle));
        }

        public String nextLine() throws IOException {
            String s = br.readLine();
            return s == null ? "-1" : s;
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens()) {
                String s = br.readLine();
                if (s == null) {
                    return "-1";
                }
                st = new StringTokenizer(s);
            }
            return st.nextToken();
        }

        public Integer nextInt() throws IOException {
            return Integer.parseInt(this.next());
        }

        public Long nextLong() throws IOException {
            return Long.parseLong(this.next());
        }

        public Double nextDouble() throws IOException {
            return Double.parseDouble(this.next());
        }

        public void close() throws IOException {
            this.br.close();
        }
    }

    public static void main(String[] args) throws IOException{
        Locale.setDefault(Locale.US);
        new Solution1().run();
    }
}