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.
[[41, -130, 44, -43, -112], [45, -142, -162, 78, -195, -6], [95, -85, 29, -52, 40], [77, -127, 18, 57, 19], [-4, -75], [74, -194, 49, -168, -188, 89, -168], [-139, 32, -176, 97, -166, -174], [15, -149, -33, -22]]