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.
[[-32, 43, -199, 37, -162, -187], [-63, 42, -64], [-161, 15, 45, 65, -98], [-42, 64, -194, -125, 55, -159, 64], [-62, -141], [-76, -103, -88], [-17, -135, 41, 3, -198, -181, 42], [70, 46, -164, 13, -43], [-98, -51]]