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.
[[-175, 90, -50, -28, -192, -164, -110], [-124, 68, 51, -20, -165], [-114, 52, -141, 69, -121, -18], [61, -103, -12, -55], [93, 79, 23, -164, -167], [-200, -13, -148, -22, -135, -4, -156], [86, 35, 5, -33]]