from random import randint
inf=998244353

def calc(a,b):
    return ((star[a][0]-star[b][0])**2+(star[a][1]-star[b][1])**2)*star[a][2]*star[b][2]

def sell(strict):
    pos=0
    go={0}
    ans=[0]
    ansdis=0
    while len(go)<N:
        next=-1
        dis=inf
        for i in range(N):
            if i not in go:
                if dist[pos][i][0]<dis:
                    next=i
                    dis=dist[pos][i][0]
        ans.append(next)
        pos=next
        ansdis+=dis
        go.add(pos)
    ans.append(0)
    while strict:
        imp=0
        l=-1
        r=-1
        for i in range(1,N):
            for j in range(i+1,N):
                pre=(dist[ans[i-1]][ans[i]][0]+dist[ans[j]][ans[j+1]][0])-(dist[ans[i-1]][ans[j]][0]+dist[ans[i]][ans[j+1]][0])
                if pre>imp:
                    l=i
                    r=j
                    imp=pre
        if l==-1:
            break
        for i in range((r-l+1)//2):
            ans[l+i],ans[r-i]=ans[r-i],ans[l+i]
    return ansdis,ans

N,M=map(int,input().split())
star=[tuple(map(int,input().split()+["5"])) for i in range(N)]+[[0,0,1] for i in range(M)]
star[N]=[star[0][0],star[0][1],1]
for i in range(M-1):
    nea=0
    pos=-1
    for j in range(N):
        for k in range(i+1):
            pre=(star[N+k][0]-star[j][0])**2+(star[N+k][1]-star[j][1])**2
            if pre>nea:
                nea=pre
                pos=j
    star[N+i+1]=[star[pos][0],star[pos][1],1]
while True:
    gr=[[0,0,0] for j in range(M)]
    for j in range(N):
        nea=inf
        pos=-1
        for k in range(M):
            pre=(star[N+k][0]-star[j][0])**2+(star[N+k][1]-star[j][1])**2
            if pre<nea:
                nea=pre
                pos=k
        gr[pos][0]+=star[j][0]
        gr[pos][1]+=star[j][1]
        gr[pos][2]+=1
    ok=0
    for j in range(M):
        if gr[j][2]!=0:
            if star[N+j][0]!=gr[j][0]//gr[j][2]:
                ok=1
                star[N+j][0]=gr[j][0]//gr[j][2]
            if star[N+j][1]!=gr[j][1]//gr[j][2]:
                ok=1
                star[N+j][1]=gr[j][1]//gr[j][2]
    if ok==0:
        break
dist=[[[calc(i,j),[j]] for i in range(N+M)]for j in range(N+M)]
for i in range(N+M):
    for j in range(N+M):
        for k in range(N+M):
            if dist[j][i][0]+dist[i][k][0]<dist[j][k][0]:
                dist[j][k]=[dist[j][i][0]+dist[i][k][0],dist[j][i][1]+dist[i][k][1]]
for i in range(M):
    print(*star[N+i][:2])
ansdis,ans=sell(True)
finalans=[]
for i in range(len(ans)-1):
    for j in dist[ans[i]][ans[i+1]][1]:
        finalans.append(j)
finalans.append(0)
print(len(finalans))
for i in finalans:
    if i>=N:
        print(2,i-N+1)
    else:
        print(1,i+1)