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.

Ex Input:
[[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]

Ex Output:
[22, 9, -80, 65]


Ex Input:
[[72, 43, 37, -195], [-123, -22, -117, -33, 67, 77, -163], [-198, -176, -16, 22, 44, 74, -90], [-10, -191, 5, 24, -69], [-168, -177], [-8, -173, -17], [-195, -46, 64, 15], [0, 59, -25, -95, -22], [45, -104, -59, -136]]

Ex Output:
[72, 77, 74, 24, -168, -8, 64, 59, 45]


Ex Input:
[[-182, 10], [80, -105, -89, 70, -152], [-130, -200], [-192, -20], [-75, -192, -84, -43]]

Ex Output:

[10, 80, -130, -20, -43]