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.

[[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]
[-18, 95, 50, 81, 49, 91, 94, 59]

[[-40, -40, 89, -120, 33], [-157, -13, 7, 45], [35, -131, 87, -23], [-125, 77, 68, -106, -2], [89, -90, 15, -2, 42, -95, 72], [-4, -179], [-119, -79], [41, -12, -110]]
[89, 45, 87, 77, 89, -4, -79, 41]

[[-168, -77, -109, -85, -115, -162], [-130, 90], [-104, -191, -126, 14, 30], [-125, -149, -147, 65], [44, 68, -27, -119, 90]]

[-77, 90, 30, 65, 90]