1 #include<iostream>
  2 #include<cstdio>
  3 #include<cstring>
  4 #include<queue>
  5 #include<algorithm>
  6 using namespace std;
  7 #define MAXN 111
  8 #define inf 1<<30
  9
 10 struct Edge{
 11     int v,cap,next;
 12 }edge[MAXN*MAXN];
 13
 14 int n,m,vs,vt,NE,NV;
 15 int head[MAXN];
 16
 17 void Insert(int u,int v,int cap)
 18 {
 19     edge[NE].v=v;
 20     edge[NE].cap=cap;
 21     edge[NE].next=head[u];
 22     head[u]=NE++;
 23
 24     edge[NE].v=u;
 25     edge[NE].cap=0;
 26     edge[NE].next=head[v];
 27     head[v]=NE++;
 28 }
 29
 30 int level[MAXN],gap[MAXN];
 31 void bfs(int vt)
 32 {
 33     memset(level,-1,sizeof(level));
 34     memset(gap,0,sizeof(gap));
 35     level[vt]=0;
 36     gap[level[vt]]++;
 37     queue<int>que;
 38     que.push(vt);
 39     while(!que.empty()){
 40         int u=que.front();
 41         que.pop();
 42         for(int i=head[u];i!=-1;i=edge[i].next){
 43             int v=edge[i].v;
 44             if(level[v]!=-1)continue;
 45             level[v]=level[u]+1;
 46             gap[level[v]]++;
 47             que.push(v);
 48         }
 49     }
 50 }
 51
 52 int pre[MAXN],cur[MAXN];
 53 int SAP(int vs,int vt)
 54 {
 55     bfs(vt);
 56     memset(pre,-1,sizeof(pre));
 57     memcpy(cur,head,sizeof(head));
 58     int maxflow=0,aug=inf;
 59     int u=pre[vs]=vs;
 60     gap[0]=NV;
 61     while(level[vs]<NV){
 62         bool flag=false;
 63         for(int &i=cur[u];i!=-1;i=edge[i].next){
 64             int v=edge[i].v;
 65             if(edge[i].cap>0&&level[u]==level[v]+1){
 66                 flag=true;
 67                 pre[v]=u;
 68                 u=v;
 69                 aug=min(aug,edge[i].cap);
 70                 if(v==vt){
 71                     maxflow+=aug;
 72                     for(u=pre[v];v!=vs;v=u,u=pre[u]){
 73                         edge[cur[u]].cap-=aug;
 74                         edge[cur[u]^1].cap+=aug;
 75                     }
 76                     aug=inf;
 77                 }
 78                 break;
 79             }
 80         }
 81         if(flag)continue;
 82         int minlevel=NV;
 83         for(int i=head[u];i!=-1;i=edge[i].next){
 84             int v=edge[i].v;
 85             if(edge[i].cap>0&&level[v]<minlevel){
 86                 minlevel=level[v];
 87                 cur[u]=i;
 88             }
 89         }
 90         if(--gap[level[u]]==0)break;
 91         level[u]=minlevel+1;
 92         gap[level[u]]++;
 93         u=pre[u];
 94     }
 95     return maxflow;
 96 }
 97
 98 char str[11];
 99 int main()
100 {
101     int _case,x,ans;
102     scanf("%d",&_case);
103     while(_case--){
104         scanf("%d%d",&n,&vt);
105         NE=0;
106         memset(head,-1,sizeof(head));
107         vs=n;
108         NV=n+1;
109         for(int i=0;i<n;i++){
110             scanf("%s%d",str,&m);
111             if(str[0]=='I')Insert(vs,i,inf);
112             while(m--){
113                 scanf("%d",&x);
114                 Insert(i,x,inf);
115                 Insert(x,i,1);
116             }
117         }
118         ans=SAP(vs,vt);
119         ans<inf?printf("%d\n",ans):puts("PANIC ROOM BREACH");
120     }
121     return 0;
122 }