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.
[[-72, -23, 40, -155, 26, -71, 42], [47, -5, -15, -120, -86, -8], [-141, -37, -174], [-49, -189, 79, -145, -142], [-22, 29, -133, -4, -94], [69, 89, -114, -165, -192, 42, -115], [-125, -77, -151, 57], [-75, -61, -121, 70, -27, -183, 56]]