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.
[[-194, 62, -175, 20, -32], [-156, -140, -25, -157, -65, 20, -108], [-65, -2, -29, 73, -16, -113], [34, 91, 76, -116], [26, -176, -46, 23, 88, -14, 31], [-139, -89, 83, -83, -12, -88, -156], [-59, 4], [9, -142, 27, -39, 23, -60, -127]]