#include <bits/stdc++.h>
using ll = long long;
#define A 0
#define B 1
#define C 2
const ll mod = 1e9 + 7;
// dp[i][j][k] 表示？中有i个a，j个b，结尾为k的方案数
void solve() {
	int n, q; std::cin >> n >> q;
	std::string s; std::cin >> s;
	std::vector dp(n + 1, std::vector(n + 1, std::vector<ll>(3, 0)));
	if(s[0] == 'a') dp[0][0][A] = 1;
	else if(s[0] == 'b') dp[0][0][B] = 1;
	else if(s[0] == 'c') dp[0][0][C] = 1;
	else {
		dp[1][0][A] = 1;
		dp[0][1][B] = 1;
		dp[0][0][C] = 1;;
	}

	for(int i = 1; i < n; i++) {
		std::vector<std::vector<std::vector<ll>>> t = dp;
		if(s[i] == '?') {
			for(int x = 0; x <= n; x++) {
				for(int y = 0; y <= n; y++) {
				
					if(x - 1 >= 0) dp[x][y][A] =( t[x - 1][y][B] + t[x - 1][y][C]) % mod;
					else dp[x][y][A] = 0;
					if(y - 1 >= 0) dp[x][y][B] = (t[x][y - 1][A] + t[x][y - 1][C]) % mod;
					else dp[x][y][B] = 0;
					dp[x][y][C] = (t[x][y][A] + t[x][y][B]) % mod;
				}
			}
		}
		else if(s[i] == 'a') {
			for(int x = 0; x <= n; x++) {
				for(int y = 0; y <= n; y++) {
					dp[x][y][A] = (t[x][y][B] + t[x][y][C]) % mod;
					dp[x][y][B] = 0;
					dp[x][y][C] = 0;
				}
			}
		}
		else if(s[i] == 'b') {
			for(int x = 0; x <= n; x++) {
				for(int y = 0; y <= n; y++) {
					dp[x][y][B] = (t[x][y][A] + t[x][y][C]) % mod;
					dp[x][y][A] = 0;
					dp[x][y][C] = 0;
				}
			}
		}
		else if(s[i] == 'c') {
			for(int x = 0; x <= n; x++) {
				for(int y = 0; y <= n; y++) {
					dp[x][y][C] = (t[x][y][A] + t[x][y][B]) % mod;
					dp[x][y][A] = 0;
					dp[x][y][B] = 0;
				}
			}
		}
//		std::cout << '\n' << i << ": " << '\n';
//		for(int x = 0; x <= n; x++) {
//			for(int y = 0; y <= n; y++) {
//				std::cerr << dp[x][y][A] + dp[x][y][B] + dp[x][y][C] << " ";
//			}
//			std::cout << '\n';
//		}
	}
	
	std::vector sum(n + 1, std::vector<int>(n + 1, 0));
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= n; j++) {
			sum[i][j] = (dp[i][j][A] + dp[i][j][B] + dp[i][j][C]) % mod;
		}
	}
	
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= n; j++) {
			if(i + 1 <= n) sum[i + 1][j] += sum[i][j];  
			sum[i][j] %= mod;
		}
	}
	
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= n; j++) {
			if(j + 1 <= n) sum[i][j + 1] += sum[i][j];
			sum[i][j] %= mod;
		}
	}
	
	std::vector sumt(n + 1, std::vector<int>(n + 1, 0));
	for(int x = 0; x <= n; x++) {
		for(int y = 0; y <= n; y++) {
			sumt[x][y] = dp[x][y][A] + dp[x][y][B] + dp[x][y][C];
			sumt[x][y] %= mod;
		}
	}
	
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= n; j++) {
			if(i + 1 <= n) sumt[i + 1][j] += sumt[i][j];  
			sumt[i][j] %= mod;
		}
	}
	int d = 0;
	for(int i = 0; i < s.size(); i++) {
		if(s[i] == '?') d++;
	}
	for(int x = 0; x <= n; x++) {
		for(int y = 0; y <= n; y++) {
			std::cerr << dp[x][y][A] + dp[x][y][B] + dp[x][y][C] << " ";
		}
		std::cout << '\n';
	}
	while(q--) {
		int x, y, z;
		std::cin >> x >> y >> z; 
		// x + y  < d - z
		ll ans = sum[x][y];
		for(int j = 0; j <= n; j++) {
			if(j > y) break;
			int i = std::min(x, d - z - 1);
			if(i < 0) break;
			ans -= sumt[i][j];
			ans %= mod;
		}
		std::cout << (ans % mod + mod) % mod<< '\n';
	}	
}

int main()
{
	//std::ios::sync_with_stdio(0);
	//std::cin.tie(0);
	//std::cout.tie(0);
	int t = 1;
//	std::cin >> t;
	while(t--) solve();
	return 0;
}