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.
[[29, -123, -29, -152, -138], [6, -100, -42, -125], [-93, -172, -79, -188, -165, -131], [17, 10, -197, 71, 77, -62], [-94, -83, -62], [-95, -29, -10, -123, 83], [-197, 66, -89]]