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.
[[-186, -72, -18, -70, 65, 71, -132], [84, -56, -126, -8, 89, 80, -23], [-41, 30], [-63, 87, -92, -110, -44, -121], [-199, -161, -198, -112], [-37, -166], [-84, -88], [90, 58]]