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.
[[32, -166], [-87, -91], [-117, -118, -8, -117, -61], [-146, -85, -111, -57, -91], [-197, -90, -121, -91, -66], [-154, -89, -37, -43], [-146, -95, -159, -141, -170, -8, -35], [-91, -68, -199, -180]]