/* Problem URL: https://codeforces.com/contest/2170/problem/D */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve()
{
    int n, q;
    cin >> n >> q;
    string a;
    cin >> a;
    
    int cur = 0;
    vi mo(n);
    int co = 0;

    int ma = 0;

    rep(i, n) {
        if (a[i] == '?') {
            co++;
            if (i > 0 && a[i - 1] == 'I') {
                mo[i] |= 1;
                ma++;
            }

            if (i < n - 1 && a[i + 1] != 'I' && a[i + 1] != '?') {
                mo[i] |= 2;
            }

            continue;
        }

        if (a[i] == 'I') {
            cur++;
            continue;
        }

        if (i > 0 && a[i - 1] == 'I') {
            cur -= 2;
        }

        if (a[i] == 'X') {
            cur += 10;
            continue;
        }

        cur += 5;
    }

    vi po(n + 1);
    po[0] = ma * 2;
    int cu = 1;

    rep(i, n) {
        if (mo[i] == 2) {
            po[cu] = po[cu - 1] + 2;
            cu++;
        }
    }

    rep(i, n) {
        if (a[i] == '?' && a[i - 1] == '?' && mo[i] == 0 && mo[i - 1] == 0) {
            mo[i - 1] |= 4;
            mo[i] |= 8;
            po[cu] = po[cu - 1] + 2;
            cu++;
        }
    }

    rep(i, n) {
        if (mo[i] == 3 || (a[i] == '?' && mo[i] == 0)) {
            po[cu] = po[cu - 1];
            cu++;
        }
    }

    rep(i, n) {
        if (mo[i] == 8) {
            po[cu] = po[cu - 1] - 2;
            cu++;
        }
    }

    rep(i, n) {
        if (mo[i] == 1) {
            po[cu] = po[cu - 1] - 2;
            cu++;
        }
    }

    while (cu <= n) {
        if (cu > 0) {
            po[cu] = po[cu - 1];
        }
        cu++;
    }

    while (q--) {
        int a, b, c;
        cin >> c >> b >> a;

        int rem = po[a];
        int tot = co;

        int ans = min(tot, a) + cur;
        tot -= min(tot, a);
        ans += min(tot, b) * 5;
        tot -= min(tot, b);
        ans += min(tot, c) * 10;

        cout << ans - rem << '\n';
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}