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.
[[60, -60, 19, -95, -172], [-23, 21, 11], [-5, -145, -20, -153, -200], [-13, 45, -76, 27], [-104, 87], [-77, -12, -135, -71], [-81, -17, 81, -140, -78, 33], [-169, -140]]