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.
[[66, -125, -2, 80, -197, -102], [11, -34, 10], [-16, -186], [53, -40, -56, -199, -162], [70, -189], [-171, -149, -145, 20, -194, 55], [-38, 78, -68]]