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.
[[80, -12, 22], [89, -185], [66, -17, -144, -58, -40, -36, -93], [-197, -71, -193], [-110, 13, -146, 70, 51, -7], [-23, -1, -95, -30], [51, 60, 99, -4, 5, -125, -82]]