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.
[[80, -57, -16, -15, -7, -59, -155], [3, 61, -100, -60, -37, 59, 100], [-162, -107], [82, -35, -136, -130, -26], [-60, -48, -99, 35], [15, 66, 13, -105], [-111, -127, -126], [99, 14, -85, 100, -101], [-41, 19]]