#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAXD 30
#define MAXM 1650
#define INF 0x3f3f3f3f
int N, T, first[MAXD], e, next[MAXM], v[MAXM], flow[MAXM];
int S, SS, d[MAXD], q[MAXD], work[MAXD];
void add(int x, int y, int z)
{v[e] = y, flow[e] = z;next[e] = first[x], first[x] = e ++;
}
void init()
{int i, j, k, n;char b[5];scanf("%d%d", &N, &T);SS = N, S = N + 1;memset(first, -1, sizeof(first[0]) * (N + 2)), e = 0;for(i = 0; i < N; i ++){scanf("%s", b);if(b[0] == 'I')add(SS, i, INF), add(i, SS, 0);scanf("%d", &n);for(j = 0; j < n; j ++){scanf("%d", &k);add(i, k, INF), add(k, i, 0);add(k, i, 1), add(i, k, 0);    }    }add(S, SS, INF);
}
int bfs()
{int i, j, rear = 0;memset(d, -1, sizeof(d[0]) * (N + 2));d[S] = 0, q[rear ++] = S;for(i = 0; i < rear; i ++)for(j = first[q[i]]; j != -1; j = next[j])if(flow[j] && d[v[j]] == -1){d[v[j]] = d[q[i]] + 1, q[rear ++] = v[j];if(v[j] == T) return 1;}return 0;
}
int dfs(int cur, int a)
{if(cur == T) return a;for(int &i = work[cur]; i != -1; i = next[i])if(flow[i] && d[v[i]] == d[cur] + 1)if(int t = dfs(v[i], std::min(a, flow[i]))){flow[i] -= t, flow[i ^ 1] += t;return t;    }return 0;
}
int dinic()
{int ans = 0, t;while(bfs()){memcpy(work, first, sizeof(first[0]) * (N + 2));while(t = dfs(S, INF))ans += t;    }return ans;
}
void solve()
{int ans = dinic();if(ans == INF)printf("PANIC ROOM BREACH\n");elseprintf("%d\n", ans);
}
int main()
{int t;scanf("%d", &t);while(t --){init();solve();}return 0;
}
/*
Sample Input:5
4 0
NI 1 1
NI 0
NI 2 1 3
I 04 0
NI 0
NI 1 0
NI 1 1
I 1 24 0
NI 2 1 2
NI 0
NI 2 1 3
I 04 0
NI 2 1 3
NI 0
NI 2 1 3
I 03 0
NI 1 2
NI 1 2
I 0Sample Output:1
PANIC ROOM BREACH
1
2
1*/