#include <bits/stdc++.h>
using namespace std;
struct _ {
  ios_base::Init i;
  _() { cin.sync_with_stdio(0), cin.tie(0); }
} _;
string build_min(long long s, long long n) {
  string ans;
  long long k = s;
  long long count = 0;
  while (k > 9 && count < n) {
    ans += "9";
    k = k - 9;
    count++;
  }
  if (n - count == 1 || n == 1) {
    ans = to_string(k) + ans;
    return ans;
  }
  if (k > 0 && count < n - 1) {
    ans = to_string(k - 1) + ans;
    count++;
  }
  while (count < n - 1) {
    ans = "0" + ans;
    count++;
  }
  if (n - count == 1) ans = "1" + ans;
  return ans;
}
string build_max(long long s, long long n) {
  string ans;
  long long k = s;
  long long count = 0;
  while (k > 9 && count < n) {
    ans += "9";
    k = k - 9;
    count++;
  }
  if (k > 0 && count < n) {
    ans += to_string(k);
    count++;
  }
  while (count < n) {
    ans += "0";
    count++;
  }
  return ans;
}
int32_t main() {
  string s;
  cin >> s;
  long long m;
  cin >> m;
  vector<long long> dp(s.length(), 0);
  for (long long i = 0; i < s.length() - 1; i++) {
    if (s[i] == s[i + 1]) dp[i + 1] = 1;
  }
  for (long long i = 2; i < s.length(); i++) {
    dp[i] += dp[i - 1];
  }
  for (long long i = 0; i < m; i++) {
    long long a, b;
    cin >> a >> b;
    cout << dp[b - 1] - dp[a - 1] << endl;
  }
  return 0;
}

### Prompt

Generate a cpp solution to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
struct _ {
  ios_base::Init i;
  _() { cin.sync_with_stdio(0), cin.tie(0); }
} _;
string build_min(long long s, long long n) {
  string ans;
  long long k = s;
  long long count = 0;
  while (k > 9 && count < n) {
    ans += "9";
    k = k - 9;
    count++;
  }
  if (n - count == 1 || n == 1) {
    ans = to_string(k) + ans;
    return ans;
  }
  if (k > 0 && count < n - 1) {
    ans = to_string(k - 1) + ans;
    count++;
  }
  while (count < n - 1) {
    ans = "0" + ans;
    count++;
  }
  if (n - count == 1) ans = "1" + ans;
  return ans;
}
string build_max(long long s, long long n) {
  string ans;
  long long k = s;
  long long count = 0;
  while (k > 9 && count < n) {
    ans += "9";
    k = k - 9;
    count++;
  }
  if (k > 0 && count < n) {
    ans += to_string(k);
    count++;
  }
  while (count < n) {
    ans += "0";
    count++;
  }
  return ans;
}
int32_t main() {
  string s;
  cin >> s;
  long long m;
  cin >> m;
  vector<long long> dp(s.length(), 0);
  for (long long i = 0; i < s.length() - 1; i++) {
    if (s[i] == s[i + 1]) dp[i + 1] = 1;
  }
  for (long long i = 2; i < s.length(); i++) {
    dp[i] += dp[i - 1];
  }
  for (long long i = 0; i < m; i++) {
    long long a, b;
    cin >> a >> b;
    cout << dp[b - 1] - dp[a - 1] << endl;
  }
  return 0;
}

```