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.

[[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]
[-26, 0, 75]

[[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]
[-55, 98, -27]

[[-16, -111], [-26, -200], [-151, 38, 14, -167, 34], [-30, -174, 38, 64], [-183, -153, 78, -30, -46, -60, -135], [-59, 41, -33, -196, -61], [-138, 20, 78, -143], [-32, -182]]

[-16, -26, 38, 64, 78, 41, 78, -32]