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.

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

[[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]
[76, -40, 87, 30, 27, 27, 51]

[[-167, 54, 59, 57, 98], [-79, -14], [8, -121, 15, -112, 74], [-150, -119, -168, 52, 91], [-26, 83, 37, -22, 14], [-90, -36, -163], [96, -105], [-182, -179, 39], [0, -18, -77, 19]]

[98, -14, 74, 91, 83, -36, 96, 39, 19]