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.

[[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]
[14, -86, 34, 47, -117]

[[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]
[70, -16, 51, 80, -45, -14, 84, 89, 49]

[[59, -27], [-192, -144, -134, -195, -43], [-75, -77, -52, 39, -115], [90, -16, -103, 70, -97, -6, -135], [-94, -176, 65], [61, -75, -62, 41]]

[59, -43, 39, 90, 65, 61]