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]

[[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]
[-7, 91, 93, 86, 39, -35, 74, 72, 17]

[[78, 25, 59], [-19, -66, -154], [-18, 2, -139, 24, -16, -107, -86], [-168, -7, 81, 37, -143, -3, -112], [-78, -105, -162, 76], [-41, -193, 2, -78, -67, 6, -57], [-95, -177, -155, -180, -191, -117, -179], [-184, 88, -8, 39, -150, -16, -100]]

[78, -19, 24, 81, 76, 6, -95, 88]