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.
[[8, -61, -128, -171, -66, 69], [-94, -106, 88, 92, 28], [-107, -119], [23, -153, -125, -198, -71], [-181, -25, -60, 83, -104, -162, 83], [75, -180], [50, -19, -120, 37, -167, -33, -90], [-165, -44], [-122, -171, -40, -125, 92, 3]]