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.
[[37, -106, -25, 51, 24], [-71, -109, -53, 61, -60], [-185, -11, 24], [-115, -72, -177], [51, -200], [69, -190, 3, -131], [-116, -101, -113, -159, -92, -199, -76]]