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.*;
public class b313
{
    public static void main(String args[])throws IOException
    {
        InputStreamReader read=new InputStreamReader(System.in);
        BufferedReader in=new BufferedReader(read);
        //System.out.println("Enter");
        String s,s1;
        int i,j,k,m;
        int l[]=new int[100000];
        int r[]=new int[100000];
        int p[]=new int[100000];
        s=in.readLine();
        m=Integer.parseInt(in.readLine());
        for(i=0;i<m;i++)
        {
            s1=in.readLine();
            StringTokenizer q=new StringTokenizer(s1);
            l[i]=Integer.parseInt(q.nextToken())-1;
            r[i]=Integer.parseInt(q.nextToken())-1;
        }
        
        for(i=0;i<s.length()-1;i++)
        {
            if(s.charAt(i)==s.charAt(i+1))
            {
                p[i+1]=p[i]+1;
            }
            else
            {
                p[i+1]=p[i];
            }
        }
        for(i=0;i<m;i++)
        {
            System.out.println(p[r[i]]-p[l[i]]);
        }
    }
}