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.

[[-105, -189, 19, -65, -189, -88, -117], [39, 62], [44, -144]]
[19, 62, 44]

[[-124, -72, 94], [40, -5, -15, -98, 79, -94, -45], [53, -40, -73, -117, -195, -50], [20, 51, -140], [-30, -112, 25, 35, 84], [-40, -135, -184, -159, -33, -59]]
[94, 79, 53, 51, 84, -33]

[[-71, -62, 83], [77, 87, -150, -38, 68], [-165, -18, 75, -43, -28, -101], [84, 53, 83, -171, -64]]

[83, 87, 75, 84]