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 CPP):

Solution:
#include <bits/stdc++.h>
inline int gcd(int a, int b) {
  while (b) b ^= a ^= b ^= a %= b;
  return a;
}
using namespace std;
struct state {
  int row, col, val;
  state(int _r, int _c, int _v) : row(_r), col(_c), val(_v) {}
  bool operator<(const state &s) const { return val > s.val; }
};
int main() {
  string s;
  cin >> s;
  int n = s.length();
  int cumul[n + 1];
  cumul[0] = 0;
  for (int i = (1); i < (n); i++) {
    if (s[i] == s[i - 1])
      cumul[i] = cumul[i - 1] + 1;
    else
      cumul[i] = cumul[i - 1];
  }
  int q, l, r;
  scanf("%d", &q);
  for (int i = (0); i < (q); i++) {
    scanf("%d%d", &l, &r);
    int ans = cumul[r - 1] - cumul[l - 1];
    printf("%d\n", ans);
  }
  return 0;
}