python3 -c "import time
R=7
C=11
N=77
W=[]
for r in range(R):
 for c in range(C):
  W.append([u*C+v for u in range(max(0,r-1),min(R,r+2)) for v in range(max(0,c-1),min(C,c+2))])
WI=[[] for _ in range(N)]
for k,w in enumerate(W):
 for i in w:
  WI[i].append(k)
cnt=[0]*N
alpha=[0]*N
T=0
best=0.0
bc=None
end=time.time()+7.0
while time.time()<end and T<100000:
 T=T+1
 order=sorted(range(N),key=lambda i:alpha[i])
 a=[0]*N
 for j,i in enumerate(order):
  a[i]=N-j
 S=[sum(a[i] for i in w) for w in W]
 F=sum(cnt[w]*S[w] for w in range(77))/T
 if F>best:
  best=F
  bc=cnt[:]
 w=max(range(77),key=lambda q:S[q])
 cnt[w]=cnt[w]+1
 for i in W[w]:
  alpha[i]=alpha[i]+1
print(T,best)
print(bc)"