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.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class Solution {
	
//	public static final double eps = 1e-9;
//	public static final int mod = 1000000007;
//	public static final double pi = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679;
//	public static final int sievesize = (int) (1e6 + 10);
//	public static boolean[] prime;
//	public static final int dx[] = {1, -1, 0, 0};
//	public static final int dy[] = {0, 0, 1, -1};

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
	}
	
	static class Task {
		
        public void solve(int testNumber, InputReader in, OutputWriter out) throws IOException { 
        	String str = in.next();
        	long[] arr = new long[str.length()];
        	long sum = 0;
        	for(int i = 1; i < arr.length; i++) 
        	{
        		if(str.charAt(i) == str.charAt(i - 1)) {
        			sum++;
        			arr[i] = sum;
        		}
        		else arr[i] = arr[i - 1];
        	}
        	int m = in.nextInt();
        	while(m-- > 0) {
        		int l = in.nextInt(), r = in.nextInt();
        		out.println((arr[r - 1] - arr[l - 1]) <= 0 ? "0" : (arr[r - 1] - arr[l - 1]));
        	}
        }
        
//        static class Node {
//        	LinkedList<Pair> list;
//        	boolean storage;
//        	
//        	public Node() {
//				list = new LinkedList<>();
//				storage = false;
//			}
//        }
        
//        static class Pair implements Comparable<Pair> {
//        	
//        	long first, second;
//        	
//        	public Pair(long first, long second) {
//        		this.first = first;
//				this.second = second;
//			}
//
//			@Override
//			public int compareTo(Pair o) {
//				return 0;
//			}	
//        }
    }
	
//	public static int[] shuffle(int arr[], Random gen) {
//		for(int i = 0, n = arr.length; i < n; i++)
//		{
//			int index = gen.nextInt(n - i) + i;
//			int temp = arr[i];
//			arr[i] = arr[index];
//			arr[index] = temp;
//		}
//		return arr;
//	}
//
//	public static boolean triangle(long a, long b, long c){
//	    return ((a+b) > c && (b+c) >a && (a+c) > b);
//	}
//		
//	public static boolean isPerfectSquare(long n){
//		if (n < 0) 
//	    	return false;
//	    long test = (long) (Math.sqrt(n) + 0.5);
//	    return test*test == n;
//	}
//		
//	public static int isnum(char s){
//		if(s=='1' || s=='2' || s=='3' || s=='4' || s=='5' || s=='6' || s=='7' || s=='8' || s=='9' || s=='0') 
//	    	return 1; 
//		return 0;
//	}
//		
//	public static long nextPowerOf2(long n){
//	    n--;
//	    n |= n >> 1;
//	    n |= n >> 2;
//	    n |= n >> 4;
//	    n |= n >> 8;
//	    n |= n >> 16;
//	    n++;
//	    return n;
//	}
//		
//	public static long gcd(long a, long b){
//	    long t; 
//	    while (b > 0){ 
//	    	a = a%b; 
//	    	t = a; 
//	    	a = b; 
//	    	b = t; 
//    	}
//	    return a;
//	}
//		
//	public static void sieve(int n){
//		prime=new boolean[sievesize+1];
//	    long x, y; 
//	    prime[0] = prime[1] = true;
//	    for(x = 2; x * x <= sievesize; x++)
//	    { 
//	    	if(!prime[(int) x])
//	    		for(y = x * x; y <= sievesize; y += x) 
//	    			prime[(int) y]=true; 
//	    }
//	}
	
	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());
        }
        
        public long nextLong() {
        	return Long.parseLong(next());
        }
        
        public int[] nextIntArray(int size) {
        	while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
        	int[] arr=new int[size];
        	for(int i = 0; i < size; i++) 
        		arr[i] = Integer.parseInt(tokenizer.nextToken());
        	return arr;
        }

        public long[] nextLongArray(int size) {
        	while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
        	long[] arr=new long[size];
        	for(int i = 0; i < size; i++) 
        		arr[i] = Long.parseLong(tokenizer.nextToken());
        	return arr;
        }
        
        public double[] nextDoubleArray(int size) {
        	while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
        	double[] arr=new double[size];
        	for(int i = 0; i < size; i++) 
        		arr[i] = Double.parseDouble(tokenizer.nextToken());
        	return arr;
        }
        
        public String[] nextStringArray(int size) throws IOException {
        	String[] arr=new String[size];
        	for(int i = 0; i < size; i++) 
        		arr[i] = reader.readLine();
        	return arr;
        }
        
        public char[] nextCharArray(int size) throws IOException {
        	char[] arr=reader.readLine().toCharArray();
        	return arr;
        }
    }
	
	static class OutputWriter {
		public PrintWriter pw;
		
		public OutputWriter(OutputStream stream) {
			pw = new PrintWriter(stream);
		}
		
		public void println(Object str) {
			pw.println(str);
		}
		
		public void print(Object str) {
			pw.print(str + " ");
		}
		
		public void close() {
			pw.close();
		}
		
		public void flush() {
			pw.flush();
		}
		
		public void printStringArray(String[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.println(arr[i]);
		}
		
		public void printIntArray(int[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
		
		public void printLongArray(long[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
		
		public void printCharArray(char[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
		
		public void printFloatArray(float[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
		
		public void printDoubleArray(double[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
	}
}