import time s=time.time() f=[] n,k=list(map(int,input().split())) l=list(map(int,input().split())) for i in range(n): f.append(list(map(int,list(input())))) for i in range(k): nl=l[i] maxb=0 maxd=[0,0,0] c=n-nl+1 for x in range(c): for y in range(c): h=sum(f[x][y:y+nl]) w=0 for z in range(nl): w+=f[x+z][y] m=max([h,w]) if maxb