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:
[[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]

Ex Output:
[91, -17, 64, 81, 54, 100]


Ex Input:
[[-181, -180, 67, -144, 81], [-111, -185, -90, -148], [-57, 8, -160, -124, -144], [-127, 69, -3, -93, -101], [57, -173, 91, -38], [-75, -50, 8, 83]]

Ex Output:
[81, -90, 8, 69, 91, 83]


Ex Input:
[[87, -69], [-133, -81, 71, 9, -175, -112, -200], [-138, 15, -72, -162, 30], [63, -72, -33, -69, -166], [-165, -73], [62, -162], [-63, 83, -18], [-139, -33, -165], [45, -98, -132, 31, -137, 47]]

Ex Output:

[87, 71, 30, 63, -73, 62, 83, -33, 47]