In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[77, 5, -63, -184, -55, -21, -66], [36, -95, -59, 29, 13, -13, 52], [-22, -74, -140, -73], [-143, -57, 44, -72, -49, -45], [-141, 12, -6, 17], [-151, -147, -1, 22, 89], [-75, -43, -170, 54, -11, -39, -200], [-135, -62], [45, -188]]