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.
[[27, 97, -15, -5, 30, 53], [2, -86, -24, -114], [-133, -51], [11, -189, 24, -187, 21, -175], [-105, 38, -30, 93], [-68, -127, -158, 28], [-171, -173, 55, -120], [-30, 41, -196, -8, -26], [-193, 23, 69, 81, -76]]