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.

Example Input: [[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]
Example Output: [76, 28, -16, 28, 74]

Example Input: [[-129, -163, 91, 74, -11, -30, -197], [-55, -146, 3, -187], [31, -111, 49, -80], [-6, -162, 70, -24, -150], [46, 61, -2, 91, 5]]
Example Output: [91, 3, 49, 70, 91]

Example Input: [[73, 64, -158, 63, 3, -105], [-34, -112, -84], [47, -15, -112, 66, -110, 47], [62, -92, -103, -72], [-31, -176, -59, -48, -177, -58], [-101, 38, -190, -190, -28], [71, 56, -104, -7, 64, -68, -87], [60, -68, -185, 80]]
Example Output:
[73, -34, 66, 62, -31, 38, 71, 80]