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.
[[14, -111, -144, -99, 80, -146, -139], [-106, -181, 52, -11, -10], [93, 98, -6, 44, -38, 6, -89], [-191, 26, -62, -61, 74, 73], [26, -131, 70, -141], [-156, -74, -104, -193], [85, -17, -182], [-76, 17, 72, 69, -37, -27, 100], [-65, -104, -8, -41, 24, -193]]