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.
[[-171, 99, 32, -58, 95, -122], [-120, 52], [1, -114], [-120, 60, 2, -83, 24, -100, -131], [-86, 65, -1, -159, -53, 94, -20], [-124, -81, -52], [-84, -6, -167, 49], [-182, -162, -130], [-8, -55, -131, 35, -106, -49, 77]]