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.
[[32, 1], [-147, -196, -16, 49, 6, -48, -24], [-17, -130, -3], [-154, 98, 57, -160, -19, 98, 37], [-98, -100, -30], [-63, 23, -65, -1, -63, -52], [-65, 71, -70], [64, 92, -167, -135, 22, 21, 32]]