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.
[[9, -108, -162, -143, -18, -185, 24], [-194, -142, -116, 96, -171, 48, 92], [-63, 68, -192, -24, -166, -163], [-149, 10, 21], [-159, -119], [55, 79, 36, 57], [-43, 4], [-99, 78, 36, -61, -136, 20]]