import sys
x=[]
o=[]
t=1
b=","
k=map
def m(c):
 m=(o,x)[t];c=k(int,c.split(b))
 if c in o+x:
  print b;sys.exit()
 m+=c;r=0
 for p in m:r=w(p,m)
 return r
def w(p,m):
 r=0
 for q in m:
  d=max(k(lambda x,y:abs(x-y),p,q))
  if d==u and e(pqm):r=1
 return r
def e(p,q,m):
 v=k(lambda p,q:(p-q)/u,q,p);l=p;
 for i in range(1,n):
  y=k(lambda j,h:j+h,l,v)
  if y not in m:
   return 0
  l=y
 return l==q
q=raw_input
d=q()
v=q()
z=d.split(b)
(n,d)=k(int,z)
a=v.split(";")
u=n-1
for c in a:
 r=m(c)
 if r:print t
 t^=t