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.
[[-186, -175, -114, 49, -49, -26, -7], [-156, -184, -149, -69, 48, 32], [-60, -157, -117, -81], [-35, -74, -55, -137, -21, 33, -138], [76, -142, -57, 35, 32, -1, -21], [-188, -15, 17, -67], [-15, 72, -58], [-104, -31, 68, -19, 6, -126]]