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.
[[-2, -132], [-111, 10, -112, 1, 26], [89, -38, 45, -96, 31], [-131, -186, -165, 38], [47, 1, -198, 50], [13, -99]]