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.
[[27, -32, -193, -189, -185, -56, 54], [89, 1, 65, 7, 13, -163, -45], [8, -114, -25], [2, -4, 95, -17, -56], [-173, -191], [14, -168, -16], [-172, 98, -26, -91, -57, 65], [-71, -131, 47, 42, 36, -134, -190]]