def check_brackets(sequence_of_brackets: str) -> bool:
    if len(sequence_of_brackets) % 2:
        return False
    brackets = {
        "(": ")",
        "[": "]",
        "{": "}",
    }
    stack = []
    for char in sequence_of_brackets:
        if char in brackets:
            stack.append(char)
        else:
            if not stack:
                return False
            open_bracket = stack.pop()
            if char != brackets[open_bracket]:
                return False
    return not stack

import math


def get_number_words_can_form(word1: str, word2: str) -> int:
    return math.floor(
        min([word2.count(letter)/word1.count(letter) for letter in set(word1)])
    )

from functools import reduce
from operator import mul


def get_divisor_numbers(divisor: int, divisors: list[int], end: int) -> set[int]:
    rest = {
        index for index in range(2,end)
        if reduce(mul, map(index.__mod__, divisors)) > 0
    }
    return {
        divisor*index for index in range(2, end)
        if reduce(mul, map(index.__mod__, divisors)) == 0
        and reduce(mul, map(index.__mod__, rest), 1) > 0
    }


def get_list_of_numbers(divisors: list[int], end: int) -> list[int]:
    # TODO use cache?
    solution = {1}.union(divisors)
    for divisor in divisors:
        # TODO good limit for end?
        solution.update(get_divisor_numbers(divisor, divisors, end*reduce(mul, divisors)))
    return sorted(list(solution))[:end]

print("3, 7 and 11")
for num in range(1, 12):
    sol = get_list_of_numbers([3,7,11], num)
    print(f"{num:2}:{len(sol):2}", sol)
print("2, 5 and 17")
for num in range(1, 12):
    sol = get_list_of_numbers([2,5,17], num)
    print(f"{num:2}:{len(sol):2}", sol)
print("7 and 13")
for num in range(1, 12):
    sol = get_list_of_numbers([7,13], num)
    print(f"{num:2}:{len(sol):2}", sol)

import itertools


def anagram(word: str, phrases: list[str]) -> list:
    anagrams = []
    for index in range(1, len(phrases)+1):
        for combination in itertools.combinations(phrases, index):
            if sorted("".join(combination)) == sorted("".join(word.split(" "))):
                anagrams.append(list(combination)))
    return anagrams