#!/usr/bin/env python3
import random,math,time
W,H,h=140,110,1
pts=[((i+.5)*h,(j+.5)*h) for j in range(int(H/h)) for i in range(int(W/h))]
pos=[(x,y) for y in range(0,H+1,5) for x in range(0,W+1,5)]
masks=[sum(1<<k for k,(a,b) in enumerate(pts) if (a-x)**2+(b-y)**2<=400) for x,y in pos]
def union(s):
 u=0
 for i in s:u|=masks[i]
 return u
def greedy(n,rand=0):
 s=[];u=0
 for _ in range(n):
  vals=sorted(((u|m).bit_count(),i) for i,m in enumerate(masks) if i not in s)
  pool=vals[-max(1,rand):];v,i=random.choice(pool);s.append(i);u|=masks[i]
 return s
def local(s):
 cur=union(s).bit_count()
 while 1:
  best=cur;move=None
  ss=set(s)
  for q in range(len(s)):
   u=union(s[:q]+s[q+1:])
   for i,m in enumerate(masks):
    if i not in ss:
     v=(u|m).bit_count()
     if v>best:best=(v);move=(q,i)
  if move is None:return cur,s
  s[move[0]]=move[1];cur=best
for n in range(8,14):
 best=(0,None)
 for r in range(8):
  v,s=local(greedy(n,1 if r==0 else 20))
  if v>best[0]:best=(v,s)
 print(n,best[0],best[0]/15400,[pos[i] for i in best[1]])