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.
[[-93, -61, -107, 90, -86, -9, -108], [0, -177, 31, 26], [-55, -81, 54], [-196, -8], [-54, 55, -197, -19, 81, -69, -187], [40, -11, -140, -86], [36, -18], [-71, -189, -119, -187, -150, -58]]