1from itertools import permutations
 2
 3def set_partitions(collection):
 4    """Function gifted by a wise wizard."""
 5    if len(collection) == 1:
 6        yield [collection]
 7        return
 8    
 9    first = collection[0]
10    for smaller in set_partitions(collection[1:]):
11        for n, subset in enumerate(smaller):
12            yield smaller[:n] + [[ first ] + subset]  + smaller[n+1:]
13        yield [[first]] + smaller
14
15
16def organize(cars, students):
17    if len(students) > len(cars) * 4:
18        return False
19    
20    def filter_students_sets(students_set):
21        if len(students_set) > len(cars):
22            return False
23        for students in students_set:
24            if len(students) > 4:
25                return False
26        return True
27    
28    def fix_students_sets(student_set):
29        if len(student_set) < len(cars):
30            for _ in range(len(cars) - len(student_set)):
31                student_set.append([])
32        return student_set
33  
34    students_partitons_sets = list(map(fix_students_sets,filter(filter_students_sets, set_partitions(students))))
35    
36    for car_permutation in permutations(cars):
37        for students_permutation in students_partitons_sets:
38            for car, students_set in zip(car_permutation, students_permutation):
39                for student in students_set:
40                    car.add_student(student)
41            if all(student.is_comfy() for student in students):
42                return True
43            for car, students_set in zip(car_permutation, students_permutation):
44                for student in students_set:
45                    car.remove_student(student)
46    return False