#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define uint unsigned
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 310;
const ll mod = 1000000007;

int n, m, f[maxn][maxn][maxn][3], g[maxn][maxn][maxn];
char s[maxn];

inline void upd(int &x, int y) {
	x = (x + y < mod ? x + y : x + y - mod);
}

void solve() {
	scanf("%d%d%s", &n, &m, s + 1);
	if (s[1] == 'a' || s[1] == '?') {
		f[1][0][0][0] = 1;
	}
	if (s[1] == 'b' || s[1] == '?') {
		f[0][1][0][1] = 1;
	}
	if (s[1] == 'c' || s[1] == '?') {
		f[0][0][1][2] = 1;
	}
	int ca = 0, cb = 0, cc = 0;
	for (int i = 1; i <= n; ++i) {
		ca += (s[i] == 'a');
		cb += (s[i] == 'b');
		cc += (s[i] == 'c');
	}
	for (int i = 0; i <= n; ++i) {
		for (int j = 0; j <= n; ++j) {
			for (int k = 0; k <= n; ++k) {
				for (int x = 0; x < 3; ++x) {
					if (!f[i][j][k][x]) {
						continue;
					}
					if (i + j + k == n) {
						continue;
					}
					for (int y = 0; y < 3; ++y) {
						if (x == y) {
							continue;
						}
						if (s[i + j + k + 1] != '?' && s[i + j + k + 1] != 'a' + y) {
							continue;
						}
						int ni = i + (y == 0), nj = j + (y == 1), nk = k + (y == 2);
						upd(f[ni][nj][nk][y], f[i][j][k][x]);
					}
				}
			}
		}
	}
	for (int i = ca; i <= n; ++i) {
		for (int j = cb; j <= n; ++j) {
			int k = n - i - j;
			for (int x = 0; x < 3; ++x) {
				if (!f[i][j][k][x]) {
					continue;
				}
				upd(g[i - ca][j - cb][k - cc], f[i][j][k][x]);
			}
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j <= n; ++j) {
			for (int k = 0; k <= n; ++k) {
				upd(g[i][j][k], g[i - 1][j][k]);
			}
		}
	}
	for (int i = 0; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			for (int k = 0; k <= n; ++k) {
				upd(g[i][j][k], g[i][j - 1][k]);
			}
		}
	}
	for (int i = 0; i <= n; ++i) {
		for (int j = 0; j <= n; ++j) {
			for (int k = 1; k <= n; ++k) {
				upd(g[i][j][k], g[i][j][k - 1]);
			}
		}
	}
	while (m--) {
		int x, y, z;
		scanf("%d%d%d", &x, &y, &z);
		x = min(x, n);
		y = min(y, n);
		z = min(z, n);
		printf("%d\n", g[x][y][z]);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}