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.*;

import java.util.StringTokenizer;


/**
 * Created by L i o n on 9/6/2016.
 */
public class Main {
    //Template
    //UVa 11094
    public static PrintWriter out;

    //-----------MyScanner class for faster input----------
     static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

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

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }


        public static void main(String[] args) {
            out = new PrintWriter(new BufferedOutputStream(System.out));
            task solver = new task();
            solver.solve();
            out.close();

        }

    static class task {


        //int m,s;

        public void solve() {
            //InputStream inputStream = System.in;
            //Scanner in = new Scanner(inputStream);
            MyScanner in=new MyScanner();
            //out = new PrintWriter(new BufferedOutputStream(System.out));
            char[] data=in.nextLine().toCharArray();
            int[] rsq=new int[data.length];
            rsq[0]=0;
            for(int j=1;j<(data.length);j++){
               if(data[j]==data[j-1]) rsq[j]=rsq[j-1]+1;
                else rsq[j]=rsq[j-1];
            }
            int m=Integer.parseInt(in.nextLine());
            StringTokenizer idata;

            for(int i=0;i<m;i++){
               idata=new StringTokenizer(in.nextLine());
                int l=Integer.parseInt(idata.nextToken())-1;
                int r=Integer.parseInt(idata.nextToken())-1;
                out.println(rsq[r]-rsq[l]);
            }

            //System.out.println(max);


        }


    }
}