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.

[[-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]]
[81, -90, 8, 69, 91, 83]

[[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]
[22, -12, 60, 59, -8, 90]

[[-102, -6, 66, -94, 48, -144], [-157, 37, -155], [-156, -74, -128, -200, -9]]

[66, 37, -9]