#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back

using namespace std;

typedef pair<int, int> PII;

const int N = 410, M = 8, NN = (1<<18) + 10, MM = 1<<6;

// 0 OK, 1 WA, 2 TL, 3 ML, 4 RE
vector<PII> e[NN]; // v, edge_id
int n, m;
struct Rec {
    int st, ti, mem;
    Rec() {}
    Rec(int st_, int ti_, int mem_): st(st_), ti(ti_), mem(mem_) {}
};
Rec rec[N][M], res[M];
char sts[5] = {'O', 'W', 'T', 'M', 'R'};
queue<int> q;
int pre[NN], d[NN], T, pid[NN];

int get(int x, int y, int z) { // vd, time, memory
    return x*MM*MM + y*MM + z;
}
Rec work(string s) {
    Rec ret;
    for(int i = 0; i < 5; i ++) {
        if(s[0] == sts[i]) ret.st = i;
    }
    int p1 = s.find(','), p2 = s.find('/');
    ret.ti = stoi(s.substr(p1+1, p2-p1-1));
    ret.mem = stoi(s.substr(p2+1));
    return ret;
}
int bfs() {
    memset(pre, -1, sizeof pre);
    memset(d, 0x3f, sizeof d);
    q.push(0);
    d[0] = 0;
    while(q.size()) {
        auto u = q.front(); q.pop();
        if(u == T) return d[T];
        for(auto [v, id]: e[u]) {
            if(v == u) continue;
            if(d[u]+1 < d[v]) {
                d[v] = d[u]+1;
                pre[v] = u;
                pid[v] = id;
                q.push(v);
            }
        }
    }
    return d[T];
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i ++) {
        for(int j = 0; j < m; j ++) {
            string s; cin >> s;
            rec[i][j] = work(s);
            if(!res[j].st) {
                res[j].st = rec[i][j].st;
                res[j].ti = max(res[j].ti, rec[i][j].ti);
                res[j].mem = max(res[j].mem, rec[i][j].mem);
            }
        }
    }
    for(int St = 0; St < (1<<m); St ++) {
        for(int Ti = 0; Ti < (1<<m); Ti ++) {
            for(int Mem = 0; Mem < (1<<m); Mem ++) {
                int id = get(St, Ti, Mem);
                int mask = St & Ti & Mem;
                for(int i = 1; i <= n; i ++) {
                    bool ok = true;
                    for(int j = 0; j < m; j ++) {
                        if((~mask>>j & 1) && (!res[j].st || (~St>>j & 1))) { // 考虑限制
                            // 不是 ac 且不同
                            // ti超出限制
                            // mem超出限制
                            if(rec[i][j].st && res[j].st != rec[i][j].st ||
                                rec[i][j].ti > res[j].ti ||
                                rec[i][j].mem > res[j].mem) {
                                ok = false;
                                break;
                            }
                        }
                    }
                    if(ok) {
                        int nst = St, nti = Ti, nmem = Mem;
                        for(int j = 0; j < m; j ++) {
                            if(rec[i][j].st == res[j].st) nst |= 1<<j;
                            if(rec[i][j].ti == res[j].ti) nti |= 1<<j;
                            if(rec[i][j].mem == res[j].mem) nmem |= 1<<j;
                        }
                        int nid = get(nst, nti, nmem);
                        e[id].eb(nid, i);
                    }
                }
            }
        }
    }
    T = get((1<<m)-1, (1<<m)-1, (1<<m)-1);
    cout << bfs() << '\n';
    int t = T;
    vector<int> ans;
    while(pre[t] != -1) {
        ans.pb(pid[t]);
        t = pre[t];
    }
    for(int i = ans.size()-1; i >= 0; i --) {
        cout << ans[i] << " \n"[i==0];
    }
    return 0;
}