def f(key,hashSize):
    return key%hashSize
x = input()
#x = "4/1,1,1,1,1,2"
hashSize,keys = x.split("/")
hashSize = int(hashSize)
keys = [i for i in keys.split(",")]
key = []
for i in keys:
    if "-" in i:
        t1,t2 = i.split("-")
        t1,t2 = int(t1),int(t2)
        for j in range(t1,t2+1):
            if int(j) not in key:
                key.append(int(j))
    else:
        if int(i) not in key:
            key.append(int(i))

hashTable = []
for i in range(hashSize):
    hashTable.append([])
    
for i in key:
    hashTable[f(i,hashSize)].insert(0,i)

maxLen = max([len(i) for i in hashTable])

for i in range(len(hashTable)):
    if len(hashTable[i]) ==maxLen:
        break



# output:
t = []
for j in hashTable[i]:
    if j not in t:
        t.append(j)
t = [ str(j) for j in t]
print(str(maxLen)+"-"+str(i)+"-"+" ".join(t))