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.
[[25, -39, -165], [-98, 79, -75, -2, -153, -148, 95], [-193, -126], [-167, 29], [-198, -14, -46, -169, -45, -110], [91, -85, -16, 79, -198], [-183, -156, 61, -25]]