#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 55;
int n, m, f[N], cnt[N];
char s[N];
const int Mod = 1e9 + 7;
int add(int a, int b) { return a + b >= Mod ? a + b - Mod : a + b; }
int mul(int a, int b) { return 1ll * a * b % Mod; }
void Add(int &a, int b) { a = add(a, b); }
void Del(int &a, int b) { a = add(a, Mod - b); }
int power(int a, int b) {
  int ans = 1;
  for (; b; b >>= 1, a = mul(a, a))
    if (b & 1) ans = mul(ans, a);
  return ans;
}
int fac[N], inv[N];
int ans[M][M], prod = 1;
void prework() {
  fac[0] = fac[1] = inv[0] = inv[1] = 1;
  for (int i = 2; i <= n; i++) fac[i] = mul(fac[i - 1], i);
  inv[n] = power(fac[n], Mod - 2);
  for (int i = n - 1; i >= 2; i--) inv[i] = mul(inv[i + 1], i + 1);
}
void ins(int x) {
  for (int i = n / 2; i >= x; i--) Add(f[i], f[i - x]);
}
void del(int x) {
  for (int i = x; i <= n / 2; i++) Del(f[i], f[i - x]);
}
void BAG() {
  f[0] = 1;
  for (int i = 0; i < 52; i++)
    if (cnt[i]) ins(cnt[i]);
  for (int i = 0; i < 52; i++) {
    if (!cnt[i]) continue;
    del(cnt[i]);
    for (int j = i + 1; j < 52; j++) {
      if (!cnt[j]) continue;
      del(cnt[j]);
      ans[i][j] = mul(2, f[n >> 1]);
      ins(cnt[j]);
    }
    ins(cnt[i]);
  }
}
int tr(char c) {
  if ('a' <= c && c <= 'z') return c - 'a';
  return c - 'A' + 26;
}
int calc(int x, int y) {
  if (x == y) return f[n >> 1];
  if (x > y) swap(x, y);
  return ans[x][y];
}
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  prework();
  for (int i = 1; i <= n; i++) {
    if ('a' <= s[i] && s[i] <= 'z')
      ++cnt[tr(s[i])];
    else
      ++cnt[tr(s[i])];
  }
  prod = mul(fac[n / 2], fac[n / 2]);
  for (int i = 0; i < 52; i++) prod = mul(prod, inv[cnt[i]]);
  BAG();
  scanf("%d", &m);
  while (m--) {
    int x, y;
    scanf("%d%d", &x, &y);
    cout << mul(prod, calc(tr(s[x]), tr(s[y]))) << '\n';
  }
  return 0;
}
