#include <bits/stdc++.h>
#define int int64_t

using std::cin;
using std::cout;
const char endl = '\n';

const int p = 1E9 + 7;

int dp[303][303][303][3];
int pre[303][303][303];
int sum[303];

void solve() {
  int n, q;
  cin >> n >> q;
  std::string s;
  cin >> s;
  s = "#" + s;
  for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + (s[i] == '?');

  if (s[1] == '?')
    dp[1][1][0][0] = dp[1][0][1][1] = dp[1][0][0][2] = 1;
  else
    dp[1][0][0][s[1] - 'a'] = 1;

  for (int i = 1; i < n; ++i) {
    for (int a = 0; a <= sum[i]; ++a) {
      for (int b = 0; b + a <= sum[i]; ++b) {
        int tot = dp[i][a][b][0] + dp[i][a][b][1] + dp[i][a][b][2];
        if (s[i + 1] == '?') {
          dp[i + 1][a + 1][b][0] = (dp[i + 1][a + 1][b][0] + tot - dp[i][a][b][0]) % p;
          dp[i + 1][a][b + 1][1] = (dp[i + 1][a][b + 1][1] + tot - dp[i][a][b][1]) % p;
          dp[i + 1][a][b][2] = (dp[i + 1][a][b][2] + tot - dp[i][a][b][2]) % p;
        } else
          dp[i + 1][a][b][s[i + 1] - 'a'] = (dp[i + 1][a][b][s[i + 1] - 'a'] + tot - dp[i][a][b][s[i + 1] - 'a']) % p;
      }
    }
  }
  // cout << (dp[n][1][0][0] + dp[n][1][0][1] + dp[n][1][0][2]) << endl;

  for (int i = 0; i <= 300; ++i) {
    for (int j = 0; j <= 300; ++j) {
      for (int k = 0; k <= 300; ++k) {
        if (i + j + k == sum[n]) pre[i][j][k] = (pre[i][j][k] + dp[n][i][j][0] + dp[n][i][j][1] + dp[n][i][j][2]) % p;
        for (int x = 1; x < 8; ++x) {
          int ijk[3] = {i, j, k};
          int f = -1;
          for (int w = 0; w < 3; ++w) {
            if ((x >> w) & 1) {
              f *= -1;
              ijk[w]--;
            }
          }
          if(ijk[0] < 0 || ijk[1] < 0 || ijk[2] < 0) continue;
          pre[i][j][k] = (p + pre[i][j][k] + f * pre[ijk[0]][ijk[1]][ijk[2]]) % p;
        }
        // pre[i][j][k] = (now + pre[i - 1][j][k] + pre[i][j - 1][k] + pre[i][j][k - 1] + 3 * p) % p;
        // pre[i][j][k] = (pre[i][j][k] - pre[i - 1][j - 1][k] - pre[i - 1][j][k - 1] - pre[i][j - 1][k - 1] + 3 * p) % p;
        // pre[i][j][k] = (pre[i][j][k] + pre[i - 1][j - 1][k - 1] + p) % p;
      }
    }
  }
  while (q--) {
    int x, y, z;
    cin >> x >> y >> z;
    cout << pre[x][y][z] << endl;
  }
}

int32_t main() {
#ifndef _DEBUG
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
#endif
  int tc = 1;
  // std::cin >> tc;
  while (tc--) solve();
#ifdef _DEBUG
  std::cout << std::endl;
  std::cout << "Time used: " << clock() << "ms" << std::endl;
  system("pause");
  return 0;
#endif
}