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.

[[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]
[35, -69, -81, 92, 91, 58, 48, -41]

[[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]
[69, 65, -70, 55, 46, 38]

[[-28, -120, -80, 19, -36, 26, 45], [-177, -118, -147, -179], [-55, -148, -83, -146, -166, 72], [-160, -101, -28, -64, -45, -76, -171], [31, -35, -157, 14], [-130, 74], [10, -159], [-103, 89, 78], [-51, -193, -188, 75]]

[45, -118, 72, -28, 31, 74, 10, 89, 75]