You've got a string s = s1s2... s|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two integers li, ri (1 ≤ li ≤ ri ≤ |s|). The answer to the query is the number of substrings of string s[li... ri], which are palindromes.

String s[l... r] = slsl + 1... sr (1 ≤ l ≤ r ≤ |s|) is a substring of string s = s1s2... s|s|.

String t is called a palindrome, if it reads the same from left to right and from right to left. Formally, if t = t1t2... t|t| = t|t|t|t| - 1... t1.

Input

The first line contains string s (1 ≤ |s| ≤ 5000). The second line contains a single integer q (1 ≤ q ≤ 106) — the number of queries. Next q lines contain the queries. The i-th of these lines contains two space-separated integers li, ri (1 ≤ li ≤ ri ≤ |s|) — the description of the i-th query.

It is guaranteed that the given string consists only of lowercase English letters.

Output

Print q integers — the answers to the queries. Print the answers in the order, in which the queries are given in the input. Separate the printed numbers by whitespaces.

Examples

Input

caaaba
5
1 1
1 4
2 3
4 6
4 5


Output

1
7
3
4
2

Note

Consider the fourth query in the first test case. String s[4... 6] = «aba». Its palindrome substrings are: «a», «b», «a», «aba».
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.*;
import java.util.*;
import java.util.LinkedList;
import java.math.*;
import java.lang.*;
import java.util.PriorityQueue;
import static java.lang.Math.*;
@SuppressWarnings("unchecked")
public class Solution implements Runnable {
    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        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 String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
        public int nextInt() {
            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 long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long 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 double nextDouble() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

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

            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

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

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
    public static long min(long a,long b)
    {
        if(a>b)
        {
            return b;
        }
        return a;
    }
    public static int min(int a,int b)
    {
        if(a>b)
        {
            return b;
        }
        return a;
    }
    public static long max(long a,long b)
    {
        if(a>b)
        {
            return a;
        }
        return b;
    }
    public static int max(int a,int b)
    {
        if(a>b)
        {
            return a;
        }
        return b;
    }
    static class pair implements Comparable<pair>
    {
      int x;
      int y;
      pair(int x,int y)
      {
        this.x = x;
        this.y = y;
      }
      public int compareTo(pair b)
      {
        if(this.x>b.x)
        {
          return 1;
        }
        else if(this.x<b.x)
        {
          return -1;
        }
        else
        {
          return this.y-b.y;
        }
      }
    }
    public static int gcd(int a,int b)
    {
        if(a==0)
        return b;
        if(b==0)
        return a;
        while((a%=b)!=0&&(b%=a)!=0);
        return a^b;
    }
    public static long mod(long a)
    {
      if(a>0)
        return a;
      return -a;
    }
    static final int mod = (int)1e9+7;;
    public static long expo(long exp,long pow)
    {
      long ans = 1;
      while(pow!=0)
      {
        if((pow&1)==1)
        {
          ans = (ans*exp)%mod;
        }
        exp = (exp*exp)%mod;
        pow = pow>>1;
      }
      return ans;
    }
    static long start = 0;
    public static void start()
    {
      start = System.currentTimeMillis();
    }
    public static void end()
    {
      System.out.println(System.currentTimeMillis()-start);
    }
    public static int random(int min,int max)
    {
      return (int)((max-min)*Math.random());
    }
    public static String randString(int len)
    {
      String s = "";
      while(len-->0)
      {
          char c = (char)(97+random(0,26));
          s+=c;
      }
      return s;
    }
    public static void main(String args[]) throws Exception {
        new Thread(null, new Solution(),"Main",1<<26).start();
    }
    public void run() {
      InputReader sc  = new InputReader(System.in);
      PrintWriter out = new PrintWriter(System.out);
      int t1 = 1;
      //start();
      while(t1-->0)
      {
          String s = sc.readString();
          char[] c = s.toCharArray();
          int n = c.length;
          int p = 31;
          long[] inv = new long[n];
          long[] pow = new long[n];
          pow[0] = 1;
          inv[0] = 1;
          for(int i=1;i<n;i++)
          {
            pow[i] = (pow[i-1]*p)%mod;
            inv[i] = expo(pow[i],mod-2);
          }
          long[] prefix = new long[n];
          long[] suffix = new long[n];
          prefix[0] = ((c[0]-'a')*pow[0])%mod;
          suffix[n-1] = ((c[n-1]-'a')*pow[0])%mod;
          for(int i=1;i<n;i++)
          {
            prefix[i] = (prefix[i-1]+((c[i]-'a')*pow[i])%mod)%mod;
            suffix[n-i-1] = (suffix[n-i]+((c[n-i-1]-'a')*pow[i])%mod)%mod;
          }
          int[][] pal = new int[n][n];
          for(int i=0;i<n;i++)
          {
            for(int j=0;j<=i;j++)
            {
              long hash1 = 0;
              long hash2 = 0;
              if(j!=0)
                hash1 = ((prefix[i]-prefix[j-1]+mod)*inv[j])%mod;
              else
                hash1 = prefix[i];
              if(i!=n-1)
                hash2 = ((suffix[j]-suffix[i+1]+mod)*inv[n-i-1])%mod;
              else
                hash2 = suffix[j];
              if(hash1==hash2)
                pal[j][i]++;
            }
          }
          for(int i=0;i<n;i++){
            for(int j=1;j<n;j++){
              pal[i][j]+=pal[i][j-1];
            }
          }
          for(int i=0;i<n;i++)
          {
            for(int j=n-2;j>=0;j--)
            {
              pal[j][i] += pal[j+1][i];
            }
          }
          int k = sc.nextInt();
          while(k-->0)
          {
            int l = sc.nextInt()-1;
            int r = sc.nextInt()-1;
            out.println(pal[l][r]);
          }
        }
      //end();
      out.close();
     }
}
