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.
[[20, -72, -183, -96, 46, -166, -171], [-177, -39, -166], [-26, -4, -169, 66, -30, -68, -48], [33, -184, -112, -105, -93, -178, -199], [-42, 10, 81, -169], [0, -165, -74], [-50, 75, -67, -70], [-112, -24, -163, -14, -62, 54, 49], [-79, 53, 68, -194, -80, 92]]