#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define P 1000000007
using namespace std;

unsigned long long int calculate(string s)
{
    int n=s.length();
    int i,j,cl,L[n][n];
    for (i = 0; i < n; i++)
      L[i][i] = 1;
    for (cl=2; cl<=n; cl++)
    {
        for (i=0; i<n-cl+1; i++)
        {
            j = i+cl-1;
            if (s[i] == s[j] && cl == 2)
               L[i][j] = 2;
            else if (s[i] == s[j])
               L[i][j] = (L[i+1][j-1] + 2)%P;
            else
               L[i][j] = max(L[i][j-1], L[i+1][j]);
        }
    }
    return L[0][n-1];
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    string s;
    cin>>s;
    int t;
    cin>>t;
    while(t--)
    {
        int l,r;
        cin>>l>>r;
        string temp=s.substr(l,r-l);
        unsigned long long int result=calculate(temp);
        cout<<result<<"\n";
    }
    return 0;
}