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.
[[-141, -39, -119], [2, -111], [-12, 10, 10, -153, 25, -193], [-163, -54], [-116, -129, 41, -198, -10], [-68, 75, -18, -124, -146, -108, 95]]