#include <bits/stdc++.h>
using namespace std;
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
inline int gcd(int a, int b) {
  if (a % b)
    return gcd(b, a % b);
  else
    return b;
}
inline int lcm(int a, int b) { return (a * (b / gcd(a, b))); }
inline int And(int mask, int bit) { return mask & (1 << bit); }
inline int Or(int mask, int bit) { return mask | (1 << bit); }
inline int Xor(int mask, int bit) { return mask & (~(1 << bit)); }
char s[100100];
int n, m, x, y;
int tree[8 * 100100], a[100100];
void build(int pos, int l, int r) {
  if (l == r) {
    tree[pos] = a[l];
    return;
  }
  int mid = (l + r) >> 1, c = 2 * pos;
  build(c, l, mid);
  build(c + 1, mid + 1, r);
  tree[pos] = tree[c] + tree[c + 1];
}
int getSum(int pos, int l, int r, int x, int y) {
  if (r < x || l > y) return 0;
  if (x <= l && r <= y) return tree[pos];
  int mid = (l + r) >> 1, c = 2 * pos;
  return getSum(c, l, mid, x, y) + getSum(c + 1, mid + 1, r, x, y);
}
int main() {
  gets(s);
  n = strlen(s);
  a[1] = 0;
  for (int i = 1; i <= n - 1; i++)
    if (s[i - 1] == s[i])
      a[i + 1] = 1;
    else
      a[i + 1] = 0;
  build(1, 1, n);
  scanf(" %d ", &m);
  for (int i = 0; i < m; i++) {
    scanf("%d %d", &x, &y);
    x++;
    printf("%d\n", getSum(1, 1, n, x, y));
  }
}
