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.
[[-28, -120, -80, 19, -36, 26, 45], [-177, -118, -147, -179], [-55, -148, -83, -146, -166, 72], [-160, -101, -28, -64, -45, -76, -171], [31, -35, -157, 14], [-130, 74], [10, -159], [-103, 89, 78], [-51, -193, -188, 75]]