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.

[[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]
[0, -131, 75, 100, 90, 95, -24, 13, 10]

[[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]
[52, 80, 98, 38, 69, 81, 8, 64]

[[43, 29], [-170, 1], [84, -89, -65, -35, -127, -63], [96, -126, -43, -15, -89, -86], [-111, 91, -169, 0, -120, -165, -80]]

[43, 1, 84, 96, 91]