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.
[[39, -63, 35], [31, -139, 26, 39, 80], [-34, -24, 67, 47, -42, -129, -76], [55, -199, -74, -150, 34, 47], [-151, 24, -184], [-55, -115, -62, -138, -62, -28, 65]]