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.
[[-164, -32, -150, -71, -127, 61, 31], [33, -13, -98, -99, -171, -165], [-193, -72, -193], [42, -77, -92, -26, -191], [-136, 58, -146, 16, 56, 39, -190], [91, -4, -102, 55, -134], [-108, 100, -169, -108], [-90, 47, -101, -126], [32, -111, -136, -161, 65, 57]]