python3 -c "import random,time,math
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)
def init():
 o=list(range(N))
 o.sort(key=lambda i:(len(WI[i]),random.random()))
 a=[0]*N
 for j,i in enumerate(o):
  a[i]=N-j
 return a
def calc(a):
 return [sum(a[i] for i in w) for w in W]
def run(t,sec,a0):
 a=a0[:] if a0 else init()
 S=calc(a)
 ce=sum(max(0,x-t) for x in S)
 ba=a[:]
 bS=S[:]
 be=ce
 T=50.0
 end=time.time()+sec
 it=0
 while time.time()<end:
  it=it+1
  i=random.randrange(N)
  j=random.randrange(N)
  if i==j:
   continue
  A=list(set(WI[i]+WI[j]))
  vi=a[i]
  vj=a[j]
  d=vi-vj
  old=0
  ns=[0]*N
  for k in A:
   old=old+max(0,S[k]-t)
   z=0
   if i in W[k]:
    z=z+d
   if j in W[k]:
    z=z-d
   ns[k]=S[k]-z
  new=0
  for k in A:
   new=new+max(0,ns[k]-t)
  dd=new-old
  if dd<=0 or random.random()<math.exp(-dd/T):
   a[i]=vj
   a[j]=vi
   for k in A:
    S[k]=ns[k]
   ce=ce+dd
   if ce<be:
    be=ce
    ba=a[:]
    bS=S[:]
    if be==0:
     break
  T=T*0.9997
 return ba,be,max(bS),it
for t in [320,310,300,290,280,270]:
 a,e,m,it=run(t,1.15,None)
 print(t,e,m,it)
 if e==0:
  print(a)
  break"