#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long long int INF = 1e18;
const long long int NEGINF = -1 * INF;
long long int gcd(long long int a, long long int b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long int my_pow(long long int a, long long int n, long long int m = INF) {
  long long int res = 1;
  while (n) {
    if (n % 2) {
      res = (res * a) % m;
      n--;
    }
    a = (a * a) % m;
    n /= 2;
  }
  return res;
}
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  vector<int> a;
  a.push_back(0);
  for (int i = 0; i < n - 1; i++) {
    if (s[i] == s[i + 1]) {
      a.push_back(1);
    } else {
      a.push_back(0);
    }
  }
  for (int i = 1; i < a.size(); i++) {
    a[i] += a[i - 1];
  }
  int m;
  cin >> m;
  int l, r;
  while (m--) {
    cin >> l >> r;
    r--;
    l--;
    int ans = a[r] - a[l];
    cout << ans << "\n";
  }
}
int main() {
  std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  ;
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}

### Prompt

Develop a solution in Cpp to the problem described below:

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>
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long long int INF = 1e18;
const long long int NEGINF = -1 * INF;
long long int gcd(long long int a, long long int b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long int my_pow(long long int a, long long int n, long long int m = INF) {
  long long int res = 1;
  while (n) {
    if (n % 2) {
      res = (res * a) % m;
      n--;
    }
    a = (a * a) % m;
    n /= 2;
  }
  return res;
}
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  vector<int> a;
  a.push_back(0);
  for (int i = 0; i < n - 1; i++) {
    if (s[i] == s[i + 1]) {
      a.push_back(1);
    } else {
      a.push_back(0);
    }
  }
  for (int i = 1; i < a.size(); i++) {
    a[i] += a[i - 1];
  }
  int m;
  cin >> m;
  int l, r;
  while (m--) {
    cin >> l >> r;
    r--;
    l--;
    int ans = a[r] - a[l];
    cout << ans << "\n";
  }
}
int main() {
  std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  ;
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}

```