Implement an algorithm to find all possible combinations of a given set of email labels that can be applied to a message based on a set of constraint rules.
Implement find_label_combinations(labels, rules). Each rule is a dictionary with type requires, excludes, at_least_one, at_most_one, or exactly_one. Return every valid combination as a list of labels, with combinations and the outer result sorted lexicographically.
Input: unique label strings and valid rule dictionaries. Output: all satisfying combinations, including [] when valid.
def find_label_combinations(labels, rules):