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.
[[-154, -6, 42, 74, -171], [-154, -163, -135, -101, -9], [-123, -127, 5, -159, 72, -175, -200], [-63, -137, -185, -40], [-100, -59, -22, -89], [-166, -155, 78, -60, -36, -28], [-79, 35, -159, 85, -10], [25, -4, -17, -21]]