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.
[[-45, -56, -36, -52, -3, -172, -25], [-141, 1, -9, -168, 36, -53], [71, -56, 99], [-184, 57, 76, 7, 4, 95], [-102, -97, -167, -18, 38, 64], [16, -101, 90], [-99, -68], [-144, -12], [-89, 58, 6, -87]]