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.

[[4, -119, -5, 16, -97], [-189, 64, 89, 8]]
[16, 89]

[[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]
[58, 54, 100, 65]

[[-71, -19, -146, -73], [-120, -9, -45, -40, 6, -58], [-109, -104, -16, -198, -96, 77], [75, -145, -28], [-121, -100, -27, 9], [99, -138], [-191, -1, -106]]

[-19, 6, 77, 75, 9, 99, -1]