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.
[[61, -105, -170, -98, -133, -57, -170], [-192, -37, 79, 91, 85, 8], [-10, 18, -98], [-31, -131, -41, -194, 80, -69, -95], [31, -102, 44, -120, -34, -67], [-188, -120, -110, 31, -26], [-86, -198, -144, 83, -194, -28]]