def reachable_rec(graph, node, seed):
    if node not in seed:
        seed.append(node)
    else:
        pass
    for el in graph[node]:
        if el not in seed:
            seed.append(el)
    return seed


def reachable(graph, node):
    seed = [node]
    for el in graph[node]:
        reachable_rec(graph, el, seed)
    return seed