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.
[[41, -196, 72, -9, 87, 60, -135], [-8, -48, -107, -168, -112, -159, 35], [-115, 66, -199, -170, 50, 72], [-181, -134, -188, -9, 48, -136, -64], [27, -165, -130], [-44, -119, -56, -31, 22, -115], [99, -135, 62], [-92, 21]]