#include <stdio.h>
char s[2000];
FILE *f;
int v[200][1100];
int n,k,t,x,y,pos,prof,mincosto,sce=1;




int find(int x)
{
	int i,j,count,group;
	j=0; count = group = 1;
	for(i=1;;i++)
	{
		j++;
		if (j == n)
		{
			j =1;
			group++;
			count = 1;
		}
		if (count == group) count++;
		if (i == x) return count;
		count++;
	}


}




void profo(int costo,int pos)
{int x;
 prof++;
 for(x=pos*(n-1)-(n-2);x<=pos*(n-1);x++)
    if(v[x][prof])
         {costo+=v[x][prof];
          if(prof==k) {if(find(x)==n && costo<mincosto) mincosto=costo;}
          else profo(costo,find(x));
          costo-=v[x][prof];
         }
 prof--;
}





int main()
{
n=10;



 f=fopen("ontherun.in","r");
 while(1)
  {
   fscanf(f,"%d %d",&n,&k);
   if(n==0) exit(0);
   for(x=1;x<=n*(n-1);x++)
      {
       fscanf(f,"%d",&t);
       for(y=1;y<=t;y++) fscanf(f,"%d",&v[x][y]);
       for(y=t+1;y<=k;y++) v[x][y]=v[x][y-t];
      }
   pos=1;
   prof=0;
   mincosto=1000000001;
   profo(0,1);
   if(mincosto<1000000001) printf("Scenario #%d\nThe best flight costs %d.\n\n",sce++,mincosto);
   else printf("Scenario #%d\nNo flight possible.\n\n",sce++);
  }
 }