#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
int n, m;
string s;
#define N 400010
int X[N], R[N];
int ans[N];
namespace S1
{
int p[N], c[N];
vector<pair<int, int>>ad[N];
vector<pair<int, int>>qr[N];
void add(int x, int w) {for (; x <= n; x += x & (-x))c[x] += w;}
int qry(int x) {int s = 0; for (; x; x -= x & (-x))s += c[x]; return s;}
void sol()
{
	string ss = "0#";
	for (int i = 0; i < n; i ++)
	{
		ss += s[i] + '#';
	}
	ss += '1';
	int M = ss.length() - 2; int id = 0;
	for (int i = 1; i <= M; i ++)
	{
		if (p[id] + id > i)p[i] = min(p[id * 2 - i], p[id] + id - i);
		while (ss[i - p[i]] == ss[i + p[i]])p[i] ++;
		if (i + p[i] > id + p[id])id = i;
	}
	for (int i = 1; i <= M; i ++)if (ss[i] == '#')
		{
			int x = i / 2, len = p[i] / 2;
			int l0 = x - len + 1, r0 = x + len;
			assert(1 <= l0 && r0 <= n);
			if ((l0 == 1) || (r0 < n && s[r0 + 1] >= s[l0 - 1]))continue;
			ad[2 * x + 1].push_back({l0, x});
		}
	for (int i = 1; i <= m; i ++)qr[X[i] + R[i]].push_back({X[i], i});
	for (int i = 1; i <= 2 * n + 1; i ++)
	{
		for (auto [l, r] : ad[i]) {add(l, +1); add(r + 1, -1);}
		for (auto [x, id] : qr[i])ans[id] -= qry(x);
	}
	for (int i = 1; i <= 2 * n + 1; i ++)p[i] = 0, ad[i].clear(), qr[i].clear();
	for (int i = 1; i <= n; i ++)c[i] = 0;
}
}
namespace S2
{
int rk[N], x[N], y[N];
int c[N], sa[N];
int sum[2][N];
vector<int>ad[N];
vector<array<int, 3>>qr[N];
void add(int t, int x) {for (; x <= n; x += x & (-x))sum[t][x] ++;}
int qry(int t, int x) {int S = 0; for (; x; x -= x & (-x))S += sum[t][x]; return S;}
void SA(string ss)
{
	int m = 'z' + 1, n = ss.length() - 1;
	for (int i = 1; i <= n; i ++)c[x[i] = ss[i]] ++;
	for (int i = 1; i <= m; i ++)c[i] += c[i - 1];
	for (int i = 1; i <= n; i ++)sa[c[x[i]] --] = i;
	// for (int i = 1; i <= n; i ++)cout << sa[i] << ' '; cout << endl;
	for (int k = 1; k <= n; k <<= 1)
	{
		int num = 0;
		for (int i = n - k + 1; i <= n; i ++)y[++ num] = i;
		for (int i = 1; i <= n; i ++)if (sa[i] - k > 0)y[++ num] = sa[i] - k;
		for (int i = 1; i <= m; i ++)c[i] = 0;
		for (int i = 1; i <= n; i ++)c[x[i]] ++;
		for (int i = 1; i <= m; i ++)c[i] += c[i - 1];
		for (int i = 1; i <= n; i ++)sa[c[x[y[i]]] --] = y[i], y[i] = 0;
		swap(x, y); x[sa[1]] = 1; num = 1;
		for (int i = 2; i <= n; i ++)x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k] ? num : ++ num);
		if (num == n)break; m = num;
		// cout << "GG:" << k << endl;
		// for (int i = 1; i <= n; i ++)cout << sa[i] << ' '; cout << endl;
	}
	for (int i = 1; i <= max(n, 'z' + 1); i ++)x[i] = y[i] = c[i] = 0;
}
void sol()
{
	string t = s; reverse(t.begin(), t.end());
	string ss = "0" + s + char('z' + 1) + t;
	SA(ss);
	for (int i = 1; i <= 2 * n + 1; i ++)rk[sa[i]] = i;
	// for (int i = 1; i <= 2 * n + 1; i ++)cout << sa[i] << ' '; cout << endl;
	// for (int i = 1; i <= 2 * n + 1; i ++)cout << rk[i] << ' '; cout << endl;
	for (int i = n + 2; i <= 2 * n + 1; i ++)
	{
		ad[rk[i]].push_back(2 * n + 2 - i);
	}
	for (int i = 1; i <= m; i ++)
	{
		// cout << "GG:" << i << " " << X[i] << ' ' << rk[X[i]] << endl;
		qr[rk[X[i]]].push_back((array<int, 3>) {X[i], R[i], i});
	}
	for (int i = 2 * n + 1; i >= 1; i --)
	{
		for (int x : ad[i])add(x & 1, x);
		for (auto tmp : qr[i])
		{
			int x = tmp[0], r = tmp[1], id = tmp[2];
			// cout << "??:" << id << " " << x << ' ' << r << ' ' << qry((x & 1) ^ 1, x + 2 * r - 1) - qry((x & 1) ^ 1, x - 1) <<  endl;
			// cout << rk[x] << endl;
			// for (int i = x + 1; i <= x + 2 * r - 1; i += 2)cout << rk[i] << ' '; cout << endl;
			ans[id] += qry((x & 1) ^ 1, x + 2 * r - 1) - qry((x & 1) ^ 1, x - 1);
		}
	}
	for (int i = 1; i <= 2 * n + 1; i ++)
	{
		sum[0][i] = sum[1][i] = 0; ad[i].clear(); qr[i].clear();
		sa[i] = rk[i] = 0;
	}
}
}
void sol()
{
	cin >> n >> m;
	cin >> s;
	for (int i = 1; i <= m; i ++)
	{
		cin >> X[i] >> R[i];
	}
	// S1 :: sol();
	S2 :: sol();
	for (int i = 1; i <= m; i ++)cout << ans[i] << '\n';
	for (int i = 1; i <= m; i ++)ans[i] = 0;
}
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int op, T;
	cin >> op >> T;
	while (T --)sol();
	return 0;
}