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.
[[-131, -9, -81, -139, 23, 25], [-55, -154, -137, 83], [-63, -110], [100, -77, -60, -17, -19], [-11, -6, 76, -91, -14, -155], [24, 24, -18, 42, -12], [-4, -41, -114], [-160, 2, -162]]