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.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;



public class IlyaAndQueries {
	static InputReader in;
	static PrintWriter out;
	
	public static void main(String[] args) throws FileNotFoundException {
//		System.setIn(new FileInputStream(new File("./src/input")));
		InputStream inputStream = System.in;
	    OutputStream outputStream = System.out;
	    in = new InputReader(inputStream);
	    out = new PrintWriter(outputStream);
	    solve();
	    out.close();
		
		
	
	}
    private static void solve() {
    	String s = in.next();
		int[] array = new int[s.length()];
		for(int i=1; i<array.length; ++i)
		{
			if(s.charAt(i) == s.charAt(i-1))
				array[i] = array[i-1] + 1;
			else
				array[i] = array[i-1];
		}
		int m = in.nextInt();
		int l, h;
		
		for(int q=0; q<m; ++q)
		{
			l = in.nextInt();
			h = in.nextInt();
			--l;
			--h;
			System.out.println(array[h]-array[l]);
		}
		
	}
	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}