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]

[[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]
[-17, -31, 56, 64]

[[-15, -78, -8], [14, -107, -6, -60, -54, -92, -197], [-63, -29, -130, -190, -178, -110]]

[-8, 14, -29]