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.
[[1, -4], [15, 3, -28, -165, -196, 86], [30, 66, 55], [-47, 6, -84], [40, 4], [15, 27, -35, -169, -31, -125, 47], [-167, -80, -32], [94, 80, 26, 15]]