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.
[[43, 21, -198, -56], [-116, 68, -80], [-68, 16, -41, 9, 99, -193], [-66, -3], [-162, -42, -86, -7], [-91, 100, -133, 26], [-122, -7, -199], [-5, -139, -74, -147, -182]]