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.
[[-111, -150, -60], [-110, 65], [91, -20], [0, 3, -97], [-65, -130, -138, -189, 59], [-128, -194, -23, -48], [92, 16, -149, 96, -30, -34, 100], [-99, -6, 9], [65, -73, 1, -177, -192, 91, -34]]