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.
[[-149, -198], [58, -90], [-113, -196, -162, -150, 25], [89, -63, 68], [64, -143, -169, -158, -173, 55, 62], [86, -59, -110, -159, -96, -66], [-43, -127, -21, -117, -96, -136], [-63, -68, -109, -9, 62, 87]]