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.
[[-62, 42, -188, -36, -124, -116, -85], [-191, -139, -18, -67], [-140, 40, -2, 25, -5, -92, -49], [47, -95, 29, -53, -153, -64, -10], [-121, 68, -143], [-100, -113, -64, 18, 58, -30, -139], [-119, 76, -135, -149]]