B

def len2(a, b):
    c = 0.
    for j in range(len(a[1])):
        c += (a[1][j]-b[1][j])**2
    return c

def isrect(a, b, c):
    return len2(a, b)+len2(b, c) == len2(a, c)

n = int(input())
m = int(input())
p = []
for i in range(m):
    b = input().split()
    p.append([b[0], list(map(int, b[1:]))])
res = []
for i in range(len(p)):
    for j in p:
        if(p[i][0] == j[0]):
            continue
        for k in range(i+1, len(p)):
            if(p[i][0] == p[k][0] or j[0] == p[k][0]):
                continue
            if(isrect(p[i], j, p[k])):
                res.append(""+p[i][0]+' '+j[0]+' '+p[k][0])
print(*res, sep='\n')