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.
[[-128, -168, 23, -146, -89, -114, 68], [91, 71, -84, -113, 39], [-12, -69, -98, -143, -120], [58, -147, -136, -173, -138], [-65, -98, -114, -100, -189], [-46, -28, -78, -199], [-12, 88], [-200, 99, 83, -15, -73, -63], [86, -11, 2, -142]]