#!/usr/bin/python3
import sys


class Graph:
    def __init__(self):
        self._edges = {}

    def node(self, a):
        if a not in self._edges:
            self._edges[a] = set()
        return self._edges[a]

    def edge(self, a, b):
        self.node(a).add(b)
        self.node(b).add(a)

    def nodes(self):
        return iter(self._edges)

    def edges(self, node):
        return self._edges[node]


if __name__ == '__main__':
    g = Graph()
    for line in sys.stdin:
        if line.startswith('#'):
            continue
        a, *bs = line.split()
        a = a[:-1]
        for b in bs:
            g.edge(a, b)

    for node in sorted(g.nodes()):
        print("{}: {}".format(node, ' '.join(sorted(g.edges(node)))))