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.
[[32, 62], [37, -160, -25, -90, -129, 11], [-177, -123], [62, -97, -126, -2, 6, -58], [-172, -195, -170, -38, -85, 83], [8, -97], [-13, -92, -18, -47], [-105, -53, 79, -65, -57, 34], [-138, -184, -90]]