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.
[[-123, -98, -59, -28, 35, 35, -172], [-21, 47, 28], [-160, 33, -52, -26, -124, -126], [-199, -75, -87], [-33, 50, -68, 91, -33, -136], [-60, -60, 27, -45, -133, -188]]