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.
[[39, 39, -57], [-186, 98], [-180, 98, -127], [-36, -5, 35], [-12, -161, -40, -31], [-49, -135, -22, -62, -9, 50], [-85, 75, -61, -34, -71, -157, -142], [-167, 31, 5, -36], [-12, -78]]