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.
[[-159, 71, -199, 61, -110, -151, 13], [-164, -113, -156, -33, -105, -2], [28, -106, -184, -101, -196, -186, -127], [76, -27, -130, -96, -87], [-108, -108, -130, -102, -37, -134], [29, 100, 86], [-147, -185, -99, 64, -77, 24], [72, -85, -179, 98, -86]]