#include <bits/stdc++.h>

#define pb push_back
#define int long long
#define all(x) x.begin(), x.end()
#define ld long double
using namespace std;
const int M = 1000000007;
const int N = 305;
int dpio[N], dpoi[N];
int dpii[N][N], dpoo[N][N];
int dpmrg[N];
int noin[N], nion[N], noon[N], niin[N];
int snoin[N], snion[N], snoon[N], sniin[N];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, l;
    cin >> n >> l;
    vector<int> nn, no, ni, ii, io, in, oi, oo, on;
    for (int i = 0; i < n; i++) {
        int a;
        string s, tt;
        cin >> a >> s >> tt;
        char b = s[0], c = tt[0];
        if (b == 'n' && c == 'n') {
            nn.pb(a);
        } else if (b == 'n' && c == 'o') {
            no.pb(a);
        } else if (b == 'n' && c == 'i') {
            ni.pb(a);
        } else if (b == 'o' && c == 'n') {
            on.pb(a);
        } else if (b == 'o' && c == 'o') {
            oo.pb(a);
        } else if (b == 'o' && c == 'i') {
            oi.pb(a);
        } else if (b == 'i' && c == 'i') {
            ii.pb(a);
        } else if (b == 'i' && c == 'n') {
            in.pb(a);
        } else if (b == 'i' && c == 'o') {
            io.pb(a);
        } else {
            assert(0);
        }
    }

    int ans = 0;
    for (auto x : nn) {
        ans += (x == l);
    }

    dpio[0] = 1;
    for (auto x : io) {
        for (int c = l; c >= 0; c--) {
            if (c >= x) {
                dpio[c] += dpio[c - x];
                dpio[c] %= M;
            }
        }
    }

    dpoi[0] = 1;
    for (auto x : oi) {
        for (int c = l; c >= 0; c--) {
            if (c >= x) {
                dpoi[c] += dpoi[c - x];
                dpoi[c] %= M;
            }
        }
    }

    dpii[0][0] = 1;
    for (auto x : ii) {
        for (int k = n; k >= 0; k--) {
            for (int s = 0; s <= l; s++) {
                if (k >= 1 && s >= x) {
                    dpii[k][s] += dpii[k - 1][s - x];
                    dpii[k][s] %= M;
                }
            }
        }
    }

    dpoo[0][0] = 1;
    for (auto x : oo) {
        for (int k = n; k >= 0; k--) {
            for (int s = 0; s <= l; s++) {
                if (k >= 1 && s >= x) {
                    dpoo[k][s] += dpoo[k - 1][s - x];
                    dpoo[k][s] %= M;
                }
            }
        }
    }

    for (int c = 0; c <= l; c++) {
        for (int x = 0; x <= c; x++) {
            dpmrg[c] += (dpio[x] * dpoi[c - x]) % M;
            dpmrg[c] %= M;
        }
    }

    for (auto x : no) {
        for (auto y : in) {
            if (x + y <= l) {
                noin[x + y]++;
            }
        }
    }

    for (auto x : ni) {
        for (auto y : on) {
            if (x + y <= l) {
                nion[x + y]++;
            }
        }
    }

    for (auto x : no) {
        for (auto y : on) {
            if (x + y <= l) {
                noon[x + y]++;
            }
        }
    }

    for (auto x : ni) {
        for (auto y : in) {
            if (x + y <= l) {
                niin[x + y]++;
            }
        }
    }

    for (int r = 0; r <= l; r++) {
        for (int a = 0; a <= r; a++) {
            snoin[r] += (noin[a] * dpmrg[r - a]) % M;
            snoin[r] %= M;

            snion[r] += (nion[a] * dpmrg[r - a]) % M;
            snion[r] %= M;

            snoon[r] += (noon[a] * dpmrg[r - a]) % M;
            snoon[r] %= M;

            sniin[r] += (niin[a] * dpmrg[r - a]) % M;
            sniin[r] %= M;
        }
    }

    for (int cnt = 0; cnt <= n / 2; cnt++) {
        for (int sum1 = 0; sum1 <= l; sum1++) {
            for (int sum2 = 0; sum1 + sum2 <= l; sum2++) {
                int r = l - sum1 - sum2;
                int clc = 1;

                if (cnt != 0) {
                    clc = 1;
                    clc *= dpii[cnt][sum1];
                    clc %= M;
                    clc *= dpoo[cnt][sum2];
                    clc %= M;
                    clc *= ((snoin[r] + snion[r]) % M);
                    clc %= M;
                    ans += clc;
                    ans %= M;
                }

                clc = 1;
                clc *= dpii[cnt + 1][sum1];
                clc %= M;
                clc *= dpoo[cnt][sum2];
                clc %= M;
                clc *= snoon[r];
                clc %= M;
                ans += clc;
                ans %= M;

                clc = 1;
                clc *= dpii[cnt][sum1];
                clc %= M;
                clc *= dpoo[cnt + 1][sum2];
                clc %= M;
                clc *= sniin[r];
                clc %= M;
                ans += clc;
                ans %= M;
            }
        }
    }

    for (int s = 0; s <= l; s++) {
        int clc = noin[s];
        clc *= dpio[l - s];
        clc %= M;
        ans += clc;
        ans %= M;

        clc = nion[s];
        clc *= dpoi[l - s];
        clc %= M;
        ans += clc;
        ans %= M;
    }
    cout << ans << '\n';
}