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.

[[-45, -38], [-74, -64, -89], [-113, 74, 59, -86], [28, 57, -77, -99, 95], [-193, -88, -89, 85]]
[-38, -64, 74, 95, 85]

[[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]
[85, 82, 95, -111, 24, -112, 65, 65, 16]

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