#include <bits/stdc++.h>
using namespace std;
using LL = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;

    vector a(n, vector<int>(m));
    vector b(n, vector<int>(m));
    vector c(n, vector<int>(m));
    vector lim(n, 0);
    vector sta(n, 0);
    vector<int> aa(m), bb(m), cc(m);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            string s;
            cin >> s;
            int p0 = s.find(',');
            int p1 = s.find('/', p0);
            string s0 = s.substr(0, p0);
            string s1 = s.substr(p0 + 1, p1 - p0 - 1);
            string s2 = s.substr(p1 + 1);
            b[i][j] = stoi(s1);
            c[i][j] = stoi(s2);
            if (aa[j] == 0) {
                bb[j] = max(bb[j], b[i][j]);
                cc[j] = max(cc[j], c[i][j]);
            }
            if (s0 == "OK") {
                a[i][j] = 0;
            } else {
                int x;
                if (s0 == "WA") {
                    x = 1;
                } else if (s0 == "TL") {
                    x = 2;
                } else if (s0 == "ML") {
                    x = 3;
                } else {
                    x = 4;
                }
                a[i][j] = x;
                if (aa[j] == 0) {
                    aa[j] = x;
                }
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (a[i][j] == 0) {
                if (b[i][j] > bb[j] || c[i][j] > cc[j])
                    lim[i] |= (0b100) << (3 * j);
            } else {
                if (a[i][j] == aa[j]) {
                    if (b[i][j] > bb[j] || c[i][j] > cc[j])
                        lim[i] |= (0b100) << (3 * j);
                    else
                        lim[i] |= (0b011) << (3 * j);
                } else {
                    lim[i] |= (0b100) << (3 * j);
                }
            }
            if (a[i][j] == 0) {
                int cur = 0;
                if (b[i][j] == bb[j])
                    cur |= (0b010);
                if (c[i][j] == cc[j])
                    cur |= (0b001);
                if (aa[j] == 0)
                    cur |= (0b100);
                sta[i] |= cur << (3 * j);

            } else {
                int cur = 0;
                if (b[i][j] == bb[j])
                    cur |= (0b010);
                if (c[i][j] == cc[j])
                    cur |= (0b001);
                if (a[i][j] == aa[j] && (b[i][j] <= bb[j]) && (c[i][j] <= cc[j]))
                    cur |= (0b100);
                sta[i] |= cur << (3 * j);
            }
        }
        //cout << '\n';
    }
    const int INF = 1e9;
    const int M = (1 << (3 * m));
    vector<int> dis(M, INF);
    vector<int> pre(M, 0);
    vector<int> num(M, 0);
    queue<int> q;
    dis[0] = 0;
    q.push(0);

    while (q.size()) {
        int u = q.front();
        q.pop();

        for (int i = 0; i < n; ++i) {
            int v = u | sta[i];
            if ((v | lim[i]) != v)
                continue;
            if (dis[v] > dis[u] + 1) {
                dis[v] = dis[u] + 1;
                pre[v] = u;
                num[v] = i;
                q.push(v);
            }
        }
    }
    cout << dis[M - 1] << '\n';
    int cur = M - 1;
    vector<int> ans;
    while (cur) {
        ans.push_back(num[cur] + 1);
        cur = pre[cur];
    }
    reverse(ans.begin(), ans.end());
    for (auto v : ans)
        cout << v << ' ';
    return 0;
}