#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std ;

typedef long long LL ;

#define rep( i , a , b ) for ( int i = ( a ) ; i <  ( b ) ; ++ i )
#define clr( a , x ) memset ( a , x , sizeof a )

const int MAXN = 100005 ;
const int N = 26 ;

struct Palindromic_Tree {
    int next[MAXN][N] ;
    int fail[MAXN] ;
    int len[MAXN] ;
    int num[MAXN] ;
    int S[MAXN] , n ;
    int last ;
    int p ;

    int newnode ( int l ) {
        for ( int i = 0 ; i < N ; ++ i ) next[p][i] = 0 ;
        num[p] = 0 ;
        len[p] = l ;
        return p ++ ;
    }

    void init () {
        p = 0 ;
        newnode ( 0 ) ;
        newnode ( -1 ) ;

        last = 1 ;
        n = 0 ;
        S[0] = -1 ;
        fail[0] = 1 ;
    }

    int get_fail ( int v ) {
        while ( S[n - len[v] - 1] != S[n] ) v = fail[v] ;
        return v ;
    }

    int add ( int c ) {
        c -= 'a' ;
        S[++ n] = c ;
        int cur = get_fail ( last ) ;
        if ( !next[cur][c] ) {
            int now = newnode ( len[cur] + 2 ) ;
            fail[now] = next[get_fail ( fail[cur] )][c] ;
            next[cur][c] = now ;
            num[now] = num[fail[now]] + 1 ;
        }
        last = next[cur][c] ;
        return last ;
    }
} ;

vector < pair < int , int > > G[1005] ;
Palindromic_Tree T ;
char s[1005] ;
int n , q ;
int ans[MAXN] ;
int c[1005] ;
int p[1005] ;

void add ( int x , int v ) {
    for ( int i = x ; i <= n ; i += i & -i ) c[i] += v ;
}

int sum ( int x , int r = 0 ) {
    for ( int i = x ; i > 0 ; i -= i & -i ) r += c[i] ;
    return r ;
}

void solve () {
    int l , r ;
    T.init () ;
    scanf ( "%s" , s + 1 ) ;
    n = strlen ( s + 1 ) ;
    clr ( p , 0 ) ;
    clr ( c , 0 ) ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        G[i].clear () ;
    }
    scanf ( "%d" , &q ) ;
    for ( int i = 1 ; i <= q ; ++ i ) {
        scanf ( "%d%d" , &l , &r ) ;
        G[r].push_back ( make_pair ( l , i ) ) ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        int tmp = T.add ( s[i] ) ;
        while ( tmp > 1 ) {
            if ( p[tmp] ) add ( p[tmp] , -1 ) ;
            p[tmp] = i - T.len[tmp] + 1 ;
            add ( p[tmp] , 1 ) ;
            tmp = T.fail[tmp] ;
        }
        for ( int j = 0 ; j < G[i].size () ; ++ j ) {
            ans[G[i][j].second] = sum ( i ) - sum ( G[i][j].first - 1 ) ;
        }
    }
    for ( int i = 1 ; i <= q ; ++ i ) {
        printf ( "%d\n" , ans[i] ) ;
    }
}

int main () {
    int T ;
    scanf ( "%d" , &T ) ;
    for ( int i = 1 ; i <= T ; ++ i ) solve () ;
    return 0 ;
}