#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int Mod = 998244353;
const int inf = 0x3f3f3f3f;
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ return (int)(1ll * a * b % Mod); }

int n, m;
string stat[8][444];
int pt[8][444], pm[8][444];
int nt[8], nm[8];
string nstat[8];
int ok[444], ed[444], upd[444];
int need[66];
int dp[66][4111], rdp[66][4111];

int S, all_ed = 0, ans;
void getp(int s, int mask){
	//cout << "getp " << s << " " << mask << ": " << rdp[s][mask] << "\n";
	if(s == all_ed && mask == ((1<<(2*n)) - 1)) return ;
	rep(i, m){
		if((ok[i] | s) != S) continue;
		int nx = s | ed[i], ny = mask | upd[i];
		if((ny & need[nx - s]) != need[nx - s]) continue;
		if(dp[s][mask] + 1 + rdp[nx][ny] == ans){
			cout << i+1 << " ";
			getp(nx, ny);
			return ;
		}
	}
}

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

	cin >> n >> m;
	rep(i, n){
		nstat[i] = "-";
		rep(j, m){
			cin >> stat[i][j] >> pt[i][j] >> pm[i][j];
			if(nstat[i][0] == '-'){
				nt[i] = max(nt[i], pt[i][j]);
				nm[i] = max(nm[i], pm[i][j]);
				if(stat[i][j] != "AC")
					nstat[i] = stat[i][j];
			}
		}
		if(nstat[i] == "-") nstat[i] = "AC";
		//cout << i << ": " << nstat[i] << "\n";
	}

	rep(i, m){
		rep(j, n){
			ok[i] += (pt[j][i] <= nt[j] && pm[j][i] <= nm[j] && (stat[j][i] == "AC" || stat[j][i] == nstat[j])) << j;
			//cout << stat[j][i] << " " << nstat[j];
			ed[i] += (stat[j][i] != "AC" && stat[j][i] == nstat[j]) << j;
			//cout << ed[i] << endl;
			upd[i] += (pt[j][i] == nt[j]) << j;
			upd[i] += (pm[j][i] == nm[j]) << (n + j);
		}
		//cout << i << ": " << (bitset<4>)upd[i] << "\n";
	}
	
	rep(i, 1<<n){
		rep(j, n) if((i>>j) & 1){
			need[i] += (1 << j) + (1 << (n+j));
		}
	}

	memset(dp, 0x3f, sizeof(dp));
	dp[0][0] = 0;
	S = (1<<n) - 1;
	rep(s, 1<<n){
		rep(mask, 1<<(2*n)){
			int nv = dp[s][mask];
			if(nv >= inf) continue;
			rep(i, m){
				//cout << s << " " << mask << " " << i << " " << ed[i] << "\n";
				if((ok[i] | s) != S) continue;
				//cout << s << " " << mask << " " << i << "\n";
				int nx = s | ed[i], ny = mask | upd[i];
				if((ny & need[nx - s]) != need[nx - s]) continue;
				//cout << s << " " << mask << " " << i << ": " << ok[i] << "\n";
				//cout << nx << ": " << need[nx - s] << endl;
				if(nv + 1 < dp[nx][ny]){
					dp[nx][ny] = nv + 1;
				}
			}
		}
	}

	rep(i, n) all_ed += (nstat[i] != "AC") << i;

	cout << (ans = dp[all_ed][(1<<(2*n)) - 1]) << "\n";
	memset(rdp, 0x3f, sizeof(rdp));
	rdp[all_ed][(1<<(2*n)) - 1] = 0;

	//return 0;

	for(int s = S; s >= 0; --s){
		for(int mask = (1<<(2*n)) - 1; mask >= 0; --mask){
			rep(i, m){
				if((ok[i] | s) != S) continue;
				int nx = s | ed[i], ny = mask | upd[i];
				if((ny & need[nx - s]) != need[nx - s]) continue;
				if(rdp[nx][ny] + 1 < rdp[s][mask])
					rdp[s][mask] = rdp[nx][ny] + 1;
			}
		}
	}

	getp(0, 0);
	cout << "\n";

	return 0;
}