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.
[[10, -73, 43, -51, 85, 30, 54], [71, -133, 67], [-45, -117], [63, -109], [-116, 59, 55], [-29, 84, -46, -128, 73, -165, -181], [-200, -122, -163], [93, 58], [-22, 69, -50, -159, 38]]