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.

[[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]
[91, 53, 82, -9]

[[-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]

[[97, -155, 89, 23, -42, -149], [-85, 42, 68, -20, -116], [-148, 41, -143], [-46, 12, 54, -176], [-141, -162, 76, -36, -107], [-2, -9, -54, -35], [-67, -26, -107, 85, -114, 46, -117], [18, -36, -61, 37, -45], [-89, -151, -39]]

[97, 68, 41, 54, 76, -2, 85, 37, -39]