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.
[[-168, 74, -86, 15, 36, -84], [-44, 79, 17, 61], [-112, 47, 55, -164, -153], [73, -185], [-144, -21], [25, 81, -13, -15, -117], [40, 16, -130, -83, 24], [-148, -177]]