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.
[[-168, -171, -48, -160], [-70, -182, 31], [91, -47, -124], [-26, -171, 49, -29, 51, -71, -136], [-191, -84, 56, 69, -25, -33, 83], [-2, -162, -146, -126, -24, -184, 89], [-2, 42, -115], [-90, -26, -26, 28, -172], [-89, -165]]