#include <iostream>
#include <algorithm>
#include <cstring>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e5 + 10;

int n, q, N, res[MAXN];
char s[MAXN];
struct Qry
{
    int x, r, id;
}qt[MAXN];

int m, sa[MAXN], rk[MAXN], cnt[MAXN], p[MAXN << 1];
int f[MAXN];

struct BIT
{
    int bit[MAXN];
    inline void Add(int x, int k) {for (; x <= n; x += x & -x) bit[x] += k;}
    inline int Ask(int x) {int res = 0; for (; x; x -= x & -x) res += bit[x]; return res;}
}bt[2];

pair <int, int> st[MAXN];

int main()
{
    // freopen("string.in", "r", stdin);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    int CASE, T;
    Read(CASE), Read(T);
    while (T--)
    {
        Read(n), Read(q), Read(s + 1), N = n, s[n + 1] = 123;
        for (int i = 1; i <= n; i++) s[2 * n + 2 - i] = s[i];
        n = 2 * n + 2, s[n] = 124;
        for (int i = 1; i <= q; i++) Read(qt[i].x), Read(qt[i].r), qt[i].id = i, res[i] = 0;

        memset(cnt, 0, sizeof(cnt)), memset(rk, 0, sizeof(rk));
        m = 256;
        for (int i = 1; i <= n; i++) cnt[rk[i] = s[i]]++;
        for (int i = 2; i <= m; i++) cnt[i] += cnt[i - 1];
        for (int i = 1; i <= n; i++) sa[++cnt[rk[i] - 1]] = i;
        for (int w = 1; w < n; w <<= 1)
        {
            int top = 0;
            for (int i = n - w + 1; i <= n; i++) p[++top] = i;
            for (int i = 1; i <= n; i++)
                if (sa[i] > w) p[++top] = sa[i] - w;
            memset(cnt, 0, sizeof(cnt));
            for (int i = 1; i <= n; i++) cnt[rk[p[i]]]++;
            for (int i = 2; i <= m; i++) cnt[i] += cnt[i - 1];
            for (int i = 1; i <= n; i++) sa[++cnt[rk[p[i]] - 1]] = p[i];
            memcpy(p, rk, sizeof(rk));
            m = 0;
            for (int i = 1; i <= n; i++)
                rk[sa[i]] = (p[sa[i]] == p[sa[i - 1]] && p[sa[i] + w] == p[sa[i - 1] + w] ? m : ++m);
            if (m == n) break;
        }
        
        memset(bt[0].bit, 0, sizeof(bt[0].bit));
        memset(bt[1].bit, 0, sizeof(bt[1].bit));
        sort(qt + 1, qt + q + 1, [&](Qry u, Qry v) {return rk[u.x] > rk[v.x];});
        for (int i = n, j = 1; i >= 1; i--)
        {
            while (j <= q && qt[j].x == sa[i]) res[qt[j].id] += bt[(qt[j].x & 1) ^ 1].Ask(qt[j].x + 2 * qt[j].r - 1) - bt[(qt[j].x & 1) ^ 1].Ask(qt[j].x), j++;
            if (sa[i] > N + 1 && sa[i] < n) bt[(n - sa[i]) & 1].Add(n - sa[i], 1);
        }

        n = N;
        for (int i = 1, l = 0, r = 0; i <= n; i++)
        {
            f[i] = (i > r ? 0 : min(f[r - i + l - 1], r - i));
            while (i - f[i] > 0 && i + f[i] + 1 <= n && s[i - f[i]] == s[i + f[i] + 1]) f[i]++;
            if (i + f[i] > r) r = i + f[i], l = i - f[i] + 1;
        }
        for (int i = 1; i <= n; i++) st[i] = make_pair(i - f[i] + 1, i);
        sort(st + 1, st + n + 1), sort(qt + 1, qt + q + 1, [&](Qry u, Qry v) {return u.x < v.x;});
        memset(bt[0].bit, 0, sizeof(bt[0].bit));
        for (int i = 1, j = 1; i <= q; i++)
        {
            while (j <= n && st[j].first <= qt[i].x) bt[0].Add(st[j].second, 1), j++;
            res[qt[i].id] -= bt[0].Ask(qt[i].x + qt[i].r - 1) - bt[0].Ask(qt[i].x - 1);
        }
        for (int i = 1; i <= q; i++) cout << res[i] << '\n';
    }
    return 0;
}