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.
[[87, -69], [-133, -81, 71, 9, -175, -112, -200], [-138, 15, -72, -162, 30], [63, -72, -33, -69, -166], [-165, -73], [62, -162], [-63, 83, -18], [-139, -33, -165], [45, -98, -132, 31, -137, 47]]