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.
[[51, -26, -1], [-197, -61, -110, -41, -122, -93], [-40, -63, -48, -26, 62, -37], [82, 44, -28, -61, -157, 79]]