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.
[[11, -121, -199], [71, -135, 3, -110, 41, -200], [-88, -137, 39, -139, 49, 79, -44], [45, -75, -103, -8, 14, -110], [-186, 94, -186, -26, -115, -65], [54, -140, 15, -73, 16, 25], [-51, -69, -108, 75, 10, -96, -36]]