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.
[[25, -86, 15, -46, -149, -185], [-75, 93, -83, 30, -129, -110, 89], [-88, -63, -166, 28], [-155, -147, -26, -162], [34, -55, -35, -8, -154, -116]]