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.
[[75, -186, -132, -166, -39, -196, -163], [-130, 89, -64], [-39, -86, -73, -159], [-109, -141, 90], [70, -133, -173], [9, -197, 62, -107]]