import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Solution {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        MaximumPalindromes solver = new MaximumPalindromes();
       
       
        solver.solve(1, in, out);
        out.close();
    }

    static class MaximumPalindromes {
        private static long MOD = (long) (1e9 + 7);

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            String s = in.next();

            int count[][] = new int[s.length()][26];
            for (int i = 0; i < count.length; i++) {
                for (int j = 0; j < count[i].length; j++) {
                    int cc = (s.charAt(i) - 'a' == j ? 1 : 0);
                    count[i][j] = (i - 1 >= 0) ? (count[i - 1][j] + cc) : cc;
                }
            }
            int q = in.nextInt();
            long fact[] = new long[100001];
            fact[0] = 1;
            for (int i = 1; i < fact.length; i++) {
                fact[i] = fact[i - 1] * i;
                fact[i] %= MOD;
            }
            while (q-- != 0) {
                int rangeCount[] = new int[26];
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                for (int i = 0; i < 26; i++) {
                    rangeCount[i] = count[r][i] - (l - 1 >= 0 ? count[l - 1][i] : 0);
                }
                int cOne = 0;
                long total = 0;
                for (int i = 0; i < rangeCount.length; i++) {
                    if (rangeCount[i] % 2 == 1) {
                        cOne++;
                    }
                    rangeCount[i] /= 2;
                    total += rangeCount[i];
                }
                long ans = fact[(int) total];
                for (int i = 0; i < rangeCount.length; i++) {
                    if (rangeCount[i] != 0) {
                        ans *= MathUtils.inverse(fact[rangeCount[i]], (int) MOD);
                        ans %= MOD;
                    }

                }
                ans *= cOne == 0 ? 1 : cOne;
                ans %= MOD;
                out.println(ans);
            }
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                if (Character.isValidCodePoint(c)) {
                    res.appendCodePoint(c);
                }
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return readString();
        }

        public int nextInt() {
            return readInt();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class MathUtils {
        public static long pow(long a, long b, long MOD) {
            long ans = 1;
            while (b != 0) {
                if (b % 2 == 1) {
                    ans = (ans * a) % MOD;
                }
                b /= 2;
                a = a * a;
                a %= MOD;
            }
            return ans % MOD;
        }

        public static long inverse(long n, int MOD) {
            return pow(n, MOD - 2, MOD);
        }

    }
}